Pages that link to "Item:Q4907276"
From MaRDI portal
The following pages link to On spectral radius of the distance matrix (Q4907276):
Displaying 26 items.
- Distance spectral radius of digraphs with given connectivity (Q427824) (← links)
- Extremal unicyclic graphs with minimal distance spectral radius (Q472131) (← links)
- Distance spectral radius of graphs with \(r\) pendent vertices (Q636242) (← links)
- Some graft transformations and its application on a distance spectrum (Q641178) (← links)
- On the distance spectral radius of bipartite graphs (Q665951) (← links)
- On graphs with maximum Harary spectral radius (Q669436) (← links)
- Extremal cacti of given matching number with respect to the distance spectral radius (Q1733732) (← links)
- On the spectrum of an equitable quotient matrix and its application (Q2002687) (← links)
- Maximal distance spectral radius of 4-chromatic planar graphs (Q2020654) (← links)
- On the \(D_\alpha\)-spectral radius of cacti and bicyclic graphs (Q2092355) (← links)
- On the second largest distance eigenvalue of a block graph (Q2174519) (← links)
- The distance energy of clique trees (Q2229506) (← links)
- Perfect matching and distance spectral radius in graphs and bipartite graphs (Q2231774) (← links)
- Distance spectra of graphs: a survey (Q2250935) (← links)
- On the minimal \(\mathcal{D}_\alpha -\) spectral radius of graphs subject to fixed connectivity (Q2332442) (← links)
- Connectivity, diameter, independence number and the distance spectral radius of graphs (Q2361551) (← links)
- Complete multipartite graphs are determined by their distance spectra (Q2442444) (← links)
- Further results on the distance spectral radius of graphs (Q2851016) (← links)
- New bounds on the distance Laplacian and distance signless Laplacian spectral radii (Q5142111) (← links)
- Distance Laplacian eigenvalues and chromatic number in graphs (Q5157458) (← links)
- On the D<sub>α</sub>-spectra of graphs (Q5858708) (← links)
- (Q5867383) (← links)
- ON THE SIZE, SPECTRAL RADIUS, DISTANCE SPECTRAL RADIUS AND FRACTIONAL MATCHINGS IN GRAPHS (Q6082047) (← links)
- Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical (Q6124438) (← links)
- (Q6162647) (← links)
- Matching extension and distance spectral radius (Q6173921) (← links)