A few examples and counterexamples in spectral graph theory

DOI10.7151/dmgt.2275zbMath1433.05211OpenAlexW2994918575WikidataQ124815649 ScholiaQ124815649MaRDI QIDQ2296012

Damir Vukičević, Nikola Milosavljević, Dragan Stevanović

Publication date: 17 February 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2275

zbMATH Keywords

spectral radiusWiener indexEstrada indexintegral graphsecond Zagreb indexNEPS of graphscommunicability distancealmost cospectral graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

Related Items (1)

Proof of a conjecture on communicability distance sum index of graphs

Uses Software

• Graph6Java

Cites Work

• A note on graphs with exactly two main eigenvalues
• Tricyclic graphs with exactly two main eigenvalues
• The communicability distance in graphs
• Some results on graphs with exactly two main eigenvalues
• Construction of graphs with exactly \(k\) main eigenvalues
• Bicyclic graphs with exactly two main eigenvalues
• Integral circulant graphs
• On graphs with given main eigenvalues
• Walks and the spectral radius of graphs
• The integral graphs with index 3 and exactly two main eigenvalues
• Unicyclic graphs with exactly two main eigenvalues
• When can the components of NEPS of connected bipartite graphs be almost cospectral?
• On the components of NEPS of connected bipartite graphs
• Some results on graph spectra
• Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs
• On maximum Wiener index of trees and graphs with given radius
• On the sum of all distances in a graph or digraph
• WIENER INDEX OF TREES OF GIVEN ORDER AND DIAMETER AT MOST
• Iterative Methods without Inversion
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A few examples and counterexamples in spectral graph theory