The Laplacian of a Graph as a Density Matrix: A Basic Combinatorial Approach to Separability of Mixed States

Author： Braunstein Samuel  

Publisher： Springer Publishing Company

ISSN： 0218-0006

Source： Annals of Combinatorics, Vol.10, Iss.3, 2006-12, pp. : 291-317

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Approximations of the Generalized Inverse of the Graph Laplacian Matrix

By Bozzo Enrico   Franceschet Massimo  

Internet Mathematics, Vol. 8, Iss. 4, 2012-12 ,pp. : 456-481

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the Laplacian energy of a graph

By Lazić Mirjana  

Czechoslovak Mathematical Journal, Vol. 56, Iss. 4, 2006-12 ,pp. : 1207-1213

Springer Publishing Company

Access to resources Recommend Favorite

Separability criterion for graph-manifold groups

By Matsumoto S.  

Topology and its Applications, Vol. 93, Iss. 1, 1999-04 ,pp. : 17-33

Elsevier

Access to resources Recommend Favorite

Permanental Bounds for the Signless Laplacian Matrix of a Unicyclic Graph with Diameter d

By Li Shuchao  

Graphs and Combinatorics, Vol. 28, Iss. 4, 2012-07 ,pp. : 531-546

Springer Publishing Company

Access to resources Recommend Favorite

The packing number and Laplacian spectrum of a graph

By Wen Fei   Huang Qiongxiang   Lou Zhenzhen  

International Journal of Computer Mathematics, Vol. 91, Iss. 7, 2014-07 ,pp. : 1422-1427

Taylor & Francis Ltd

Access to resources Recommend Favorite