Extremal distance spectral radius of graphs with fixed size
From MaRDI portal
Cites work
- A q-analogue of the addressing problem of graphs by Graham and Pollak
- A bound on the spectral radius of graphs with \(e\) edges
- A generalization of the Graham-Pollak tree theorem to Steiner distance
- A survey on distance spectra of graphs
- Distance Laplacian spectra of graphs: a survey
- Distance matrices of a tree: two more invariants, and in a unified framework
- Distance matrix polynomials of trees
- Distance spectra of graphs: a survey
- Distance spectral radius of trees with fixed maximum degree
- scientific article; zbMATH DE number 193132 (Why is no real title available?)
- On distance spectral radius of graphs
- On distance spectral radius of uniform hypergraphs
- On the Addressing Problem for Loop Switching
- On the distance and distance signless Laplacian spectral radii of bicyclic graphs
- On the distance matrix of a tree
- On the maximal index of graphs with a prescribed number of edges
- On the spectral radius of (0,1)-matrices
- Proximity, remoteness and distance eigenvalues of a graph
- The distance spectrum of a tree
- The distance spectrum of complements of trees
- The distance spectrum of the pathPnand The First Distance Eigenvector of Connected Graphs
- The maximal eigenvalue of 0-1 matrices with prescribed number of ones
This page was built for publication: Extremal distance spectral radius of graphs with fixed size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6880994)
