Connected graphs of diameter two having small degree distances

MaRDI QIDQ3090706zbMATH OpenFDO

Authors Ioan Tomescu

Publication date 31 August 2011

zbMATH Keywords

bistardegree distancediametereccentricity

Mathematics Subject Classification ID

Distance in graphs (05C12) Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• Ordering connected graphs having small degree distances. II
• Properties of connected graphs having minimum degree distance
• Ordering connected graphs having small degree distances
• Degree distance and minimum degree
• Unicyclic connected graphs having smallest degree distances

Cited in

(6)

• The degree-based topological indices for two special families of graphs of diameter three
• Unicyclic connected graphs having smallest degree distances
• Ordering connected graphs having small degree distances. II
• On the total distance and diameter of graphs
• Group connectivity of graphs with diameter at most 2
• Lower connectivities of regular graphs with small diameter

This page was built for publication: Connected graphs of diameter two having small degree distances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3090706)