Pages that link to "Item:Q323085"
From MaRDI portal
The following pages link to Remoteness and distance eigenvalues of a graph (Q323085):
Displaying 18 items.
- Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph (Q824501) (← links)
- Comparing Wiener complexity with eccentric complexity (Q827592) (← links)
- On the sum of \(k\) largest distance eigenvalues of graphs (Q1735686) (← links)
- On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs (Q2001612) (← links)
- The complements of path and cycle are determined by their distance (signless) Laplacian spectra (Q2001619) (← links)
- Effects on distance energy of complete bipartite graphs by embedding edges (Q2148045) (← links)
- On the difference between proximity and other distance parameters in triangle-free graphs and \(C_4\)-free graphs (Q2172411) (← links)
- The distance eigenvalues of the complements of unicyclic graphs (Q2173322) (← links)
- Extremal problems on distance spectra of graphs (Q2217468) (← links)
- Constructing new families of transmission irregular graphs (Q2217493) (← links)
- The difference between remoteness and radius of a graph (Q2348060) (← links)
- A relation between proximity and the third largest distance eigenvalue of a graph (Q2659162) (← links)
- A conjecture on average distance and diameter of a graph (Q2890990) (← links)
- (Q4615393) (← links)
- Remoteness, proximity and few other distance invariants in graphs (Q5252386) (← links)
- On the D<sub>α</sub>-spectra of graphs (Q5858708) (← links)
- Proximity and remoteness in graphs: a survey (Q6546420) (← links)
- Distance Laplacian spectra of graphs: a survey (Q6657228) (← links)
