The \((\alpha ,\beta ,s,t)\)-diameter of graphs: a particular case of conditional diameter

DOI10.1016/j.dam.2006.04.001zbMath1105.05021arXivmath/0602437OpenAlexW2124619091WikidataQ57974504 ScholiaQ57974504MaRDI QIDQ2506366

Juan Alberto Rodríguez-Velázquez

Publication date: 28 September 2006

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

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

zbMATH Keywords

graph eigenvaluealternating polynomial

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12)

Related Items (1)

Note on structural properties of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods
• The alternating polynomials and their relation with the spectra and conditional diameters of graphs
• A spectral approach to the Randić index
• On spectral bounds for cutsets
• On a class of polynomials and its relation with the spectra and diameters of graphs
• On the superconnectivity and the conditional diameter of graphs and digraphs
• Superconnected digraphs and graphs with small conditional diameters
• On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs

This page was built for publication: The \((\alpha ,\beta ,s,t)\)-diameter of graphs: a particular case of conditional diameter