Construction of cospectral graphs

DOI10.1007/S10801-019-00900-YMaRDI QIDQ2196489zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

cospectral graphsgraph isomorphismpartial transpose

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18) Matrix equations and identities (15A24)

Abstract: Construction of non-isomorphic cospectral graphs is a nontrivial problem in spectral graph theory specially for large graphs. In this paper, we establish that graph theoretical partial transpose of a graph is a potential tool to create non-isomorphic cospectral graphs by considering a graph as a clustered graph.

Recommendations

• Constructing cospectral graphs
• Construction of cospectral regular graphs
• Construction of cospectral integral regular graphs
• Constructing cospectral bipartite graphs
• A construction of distance cospectral graphs
• Constructing cospectral graphs via a new form of graph product
• Constructing cospectral signed graphs
• Cospectrality of graphs
• Constructing families of cospectral regular graphs
• scientific article; zbMATH DE number 3968633

Cites work

• Combinatorial laplacians and positivity under partial transpose
• Condition for zero and nonzero discord in graph Laplacian quantum states
• Conditions for separability in generalized Laplacian matrices and diagonally dominant matrices as density matrices
• Constructing cospectral graphs
• Cospectral Graphs and Digraphs
• Enumeration of cospectral graphs.
• Generation of isospectral graphs
• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 3754742 (Why is no real title available?)
• scientific article; zbMATH DE number 3482386 (Why is no real title available?)
• scientific article; zbMATH DE number 3411062 (Why is no real title available?)
• Isospectral graphs and isoperimetric constants
• Partitioned tensor products and their spectra
• Quantum discord of states arising from graphs
• Recent results in the theory of graph spectra
• Seidel switching and graph energy
• Separability criterion and inseparable mixed states with positive partial transposition.
• Separability Criterion for Density Matrices
• The characteristic polynomials of modified graphs
• Unitary equivalence of a matrix to its transpose
• Which graphs are determined by their spectrum?

Cited in

(11)

• Enumeration of cospectral graphs.
• Permutation symmetric hypergraph states and multipartite quantum entanglement
• On cospectrality of gain graphs
• Cospectral constructions for several graph matrices using cousin vertices
• Constructing non-isomorphic signless Laplacian cospectral graphs
• The graphs cospectral with the pineapple graph
• A note on the degree conjecture for separability of multipartite quantum states
• Construction of cospectral graphs, signed graphs and \(\mathbb{T}\)-gain graphs via partial transpose
• Constructing cospectral graphs by unfolding non-bipartite graphs
• Constructing cospectral graphs via exotic graph products
• Graphs of order n with exactly n+1 complementarity eigenvalues

Describes a project that uses

Uses Software

• NetworkX
• SciPy

This page was built for publication: Construction of cospectral graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2196489)