Pages that link to "Item:Q1297416"

The following pages link to Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods (Q1297416):

Displaying 3 items.

• On mean distance and girth (Q608268) (← links)
• The \((\alpha ,\beta ,s,t)\)-diameter of graphs: a particular case of conditional diameter (Q2506366) (← links)
• Continuous mean distance of a weighted graph (Q6045116) (← links)