Signless Laplacians and line graphs

From MaRDI portal
Publication:5310063

DOI10.2298/BMAT0530085CzbMath1119.05066OpenAlexW1983424990MaRDI QIDQ5310063

Dragos Cvetković

Publication date: 8 October 2007

Published in: Bulletin: Classe des sciences mathematiques et natturalles (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/127847




Related Items

Merging the A-and Q-spectral theoriesA graph theoretical approach to states and unitary operationsNegative (and positive) circles in signed graphs: a problem collectionCluster anti-consensus in directed networks of multi-agents based on the \(Q\)-theorySignless Laplacians of finite graphsColor signless Laplacian energy of graphsPermanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\)Unnamed ItemSignless Laplacian energy of a first KCD matrixThe signless Laplacian spectral radius of bicyclic graphs with prescribed degree sequencesConnected graphs of fixed order and size with maximal \(A_\alpha \)-index: the one-dominating-vertex caseImpulsive cluster anticonsensus of discrete multiagent linear dynamic systemsGraph clusteringThe least signless Laplacian eignvalue of the complements of unicyclic graphsGraphs with least eigenvalue \(-2\): ten years onOn the adjacency, Laplacian, and signless Laplacian spectrum of coalescence of complete graphsThe signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edgesSignless Laplacian polynomial and characteristic polynomial of a graphTowards a spectral theory of graphs based on the signless Laplacian. II.Bounds on the \(Q\)-spread of a graphBounds on the index of the signless Laplacian of a graphThe smallest eigenvalue of the signless LaplacianSome notes on the spectral perturbations of the signless Laplacian of a graphOn the maximal signless Laplacian spectral radius of graphs with given matching numberCluster anticonsensus of multiagent systems based on the \(Q\)-theoryThe signless Laplacian spectral radius of graphs with given number of pendant vertices