Distance spectral radius of unicyclic graphs with fixed maximum degree
From MaRDI portal
Publication:5113141
DOI10.1142/S0219498820500681zbMath1441.05139OpenAlexW2920570008WikidataQ114614698 ScholiaQ114614698MaRDI QIDQ5113141
Publication date: 2 June 2020
Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219498820500681
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Connectivity (05C40) Vertex degrees (05C07)
Cites Work
- Some graft transformations and its application on a distance spectrum
- The effect of a graft transformation on distance spectral radius
- Distance spectra of graphs: a survey
- Convex and quasiconvex functions on trees and their applications
- On the distance and distance signless Laplacian spectral radii of bicyclic graphs
- Connectivity and minimal distance spectral radius of graphs
- The distance spectrum of the pathPnand The First Distance Eigenvector of Connected Graphs
- Distance spectral radius of trees with fixed maximum degree
- On the Addressing Problem for Loop Switching
This page was built for publication: Distance spectral radius of unicyclic graphs with fixed maximum degree