On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism
From MaRDI portal
Publication:710574
DOI10.1016/j.disc.2010.06.014zbMath1208.05088arXiv0906.1016OpenAlexW2034537703MaRDI QIDQ710574
Publication date: 19 October 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0906.1016
Related Items (5)
Quantum state representation based on combinatorial Laplacian matrix of star-relevant graph ⋮ Separability of density matrices of graphs for multipartite systems ⋮ A computational approach to construct a multivariate complete graph invariant ⋮ Graphs whose normalized Laplacian matrices are separable as density matrices in quantum mechanics ⋮ Multipartite separability of density matrices of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
- Conditions for separability in generalized Laplacian matrices and diagonally dominant matrices as density matrices
- Multipartite separability of Laplacian matrices of graphs
- The tripartite separability of density matrices of graphs
This page was built for publication: On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism