Signless Laplacians and line graphs
From MaRDI portal
Publication:5310063
DOI10.2298/BMAT0530085CzbMATH Open1119.05066OpenAlexW1983424990MaRDI QIDQ5310063FDOQ5310063
Authors: Dragoš 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
Recommendations
- Signless Laplacians of finite graphs
- Towards a spectral theory of graphs based on the signless Laplacian. I
- On the (signless) Laplacian spectral characterization of the line graphs of lollipop graphs
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- On the signless Laplacian spectral characterization of the line graphs of \(T\)-shape trees.
Cited In (29)
- Color signless Laplacian energy of graphs
- Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\)
- Some notes on the spectral perturbations of the signless Laplacian of a graph
- The signless Laplacian spectral radius of bicyclic graphs with prescribed degree sequences
- The smallest eigenvalue of the signless Laplacian
- The least signless Laplacian eignvalue of the complements of unicyclic graphs
- Merging the \(A\)- and \(Q\)-spectral theories
- Impulsive cluster anticonsensus of discrete multiagent linear dynamic systems
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Bounds on the \(Q\)-spread of a graph
- On the maximal signless Laplacian spectral radius of graphs with given matching number
- The signless Laplacian spectral radius of graphs with given number of pendant vertices
- A graph theoretical approach to states and unitary operations
- Adjacency spectrum and the Laplacian spectrum of a graph
- Negative (and positive) circles in signed graphs: a problem collection
- Properties of spectra of graphs and line graphs
- Signless Laplacian polynomial and characteristic polynomial of a graph
- On eigenspaces of some compound signed graphs
- Cluster anti-consensus in directed networks of multi-agents based on the \(Q\)-theory
- Laplacian and signless Laplacian degree product distance energy of some graphs
- Cluster anticonsensus of multiagent systems based on the \(Q\)-theory
- Signless Laplacian energy of a first KCD matrix
- Bounds on the index of the signless Laplacian of a graph
- Graphs with least eigenvalue \(-2\): ten years on
- Graph clustering
- Connected graphs of fixed order and size with maximal \(A_\alpha \)-index: the one-dominating-vertex case
- The signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edges
- Signless Laplacians of finite graphs
- On the adjacency, Laplacian, and signless Laplacian spectrum of coalescence of complete graphs
This page was built for publication: Signless Laplacians and line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5310063)
