Construction of cospectral graphs
DOI10.1007/s10801-019-00900-yzbMath1447.05121arXiv1808.03490OpenAlexW2975096988MaRDI QIDQ2196489
Supriyo Dutta, Bibhas Adhikari
Publication date: 2 September 2020
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.03490
Matrix equations and identities (15A24) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing cospectral graphs
- Conditions for separability in generalized Laplacian matrices and diagonally dominant matrices as density matrices
- Recent results in the theory of graph spectra
- Partitioned tensor products and their spectra
- Which graphs are determined by their spectrum?
- Enumeration of cospectral graphs.
- Quantum discord of states arising from graphs
- Isospectral graphs and isoperimetric constants
- The characteristic polynomials of modified graphs
- Separability criterion and inseparable mixed states with positive partial transposition.
- Unitary equivalence of a matrix to its transpose
- Generation of isospectral graphs
- Separability Criterion for Density Matrices
- Condition for zero and nonzero discord in graph Laplacian quantum states
- Combinatorial laplacians and positivity under partial transpose
- Cospectral Graphs and Digraphs
This page was built for publication: Construction of cospectral graphs
