Constructing non-isomorphic signless Laplacian cospectral graphs

DOI10.1016/j.disc.2019.111783zbMath1433.05229arXiv1808.04054OpenAlexW2997099701WikidataQ126432485 ScholiaQ126432485MaRDI QIDQ2297737

Supriyo Dutta

Publication date: 20 February 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.04054

zbMATH Keywords

partial transposegraph isomorphism problemnon-isomorphic cospectral graphssignless-Laplacian matrix

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

On adjacency and Laplacian cospectral non-isomorphic signed graphs ⋮ Aα spectra of graphs obtained by two corona operations and Aα cospectral graphs ⋮ Permutation symmetric hypergraph states and multipartite quantum entanglement ⋮ Connected \(Q\)-integral graphs with maximum edge-degree less than or equal to 8

Uses Software

• NetworkX
• SciPy

Cites Work

• Unnamed Item
• Constructing cospectral graphs
• Spektren endlicher Grafen
• Signless Laplacians of finite graphs
• Conditions for separability in generalized Laplacian matrices and diagonally dominant matrices as density matrices
• Which graphs are determined by their spectrum?
• Separability criterion and inseparable mixed states with positive partial transposition.
• Exponentially many graphs have a \(Q\)-cospectral mate
• Towards a spectral theory of graphs based on the signless Laplacian, I
• Separability Criterion for Density Matrices
• Graph isomorphism in quasipolynomial time [extended abstract]
• Combinatorial laplacians and positivity under partial transpose

This page was built for publication: Constructing non-isomorphic signless Laplacian cospectral graphs