-cospectrality and -energy in cographs

DOI10.1080/03081087.2017.1300230zbMath1388.05118OpenAlexW2597064479MaRDI QIDQ4640076

Fernando Colman Tura

Publication date: 16 May 2018

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2017.1300230

zbMATH Keywords

eigenvaluedistance Laplacian matrixdistance signless Laplacian matrixcograph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two Laplacians for the distance matrix of a graph
• Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows
• On the spectrum of threshold graphs
• Eigenvalues and energy in threshold graphs
• Constructing cospectral graphs
• Some spectral properties of cographs
• Complement reducible graphs
• A time-optimal solution for the path cover problem on cographs.
• The rank of a cograph
• Enumeration of cospectral graphs.
• A simple linear time algorithm for cograph recognition
• Laplacian spectra and spanning trees of threshold graphs
• Eigenvalue location in threshold graphs
• On the distance and distance signless Laplacian spectral radii of bicyclic graphs
• Exploring Symmetries to Decompose Matrices and Graphs Preserving the Spectrum
• Graph Energy
• A Linear Recognition Algorithm for Cographs
• On the Addressing Problem for Loop Switching
• Wiener index of trees: Theory and applications