On mean distance and girth

DOI10.1016/j.dam.2010.06.013zbMath1216.05021OpenAlexW2035815834MaRDI QIDQ608268

Mekkia Kouider, Siham Bekkai

Publication date: 25 November 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.06.013

zbMATH Keywords

girthmean distance

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (2)

On mean distance and girth ⋮ Open quipus with the same Wiener index as their quadratic line graph

Uses Software

• AutoGraphiX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On mean distance and girth
• Eigenvalues, diameter, and mean distance in graphs
• Mean distance in a graph
• Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods
• Average distance and independence number
• Using minimum degree to bound average distance
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• On the sum of all distances in a graph or digraph
• Average distance in graphs with removed elements
• Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille
• The average distance and the independence number
• On mean distance in certain classes of graphs
• Edge-vulnerability and mean distance
• Mean distance and minimum degree
• Average distance, minimum degree, and spanning trees

This page was built for publication: On mean distance and girth