Ordering connected graphs having small degree distances

DOI10.1016/j.dam.2010.05.023zbMath1208.05021MaRDI QIDQ602693

Ioan Tomescu

Publication date: 5 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.05.023

zbMATH Keywords

tree; diameter; eccentricity; degree distance; bistar

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C07: Vertex degrees

Related Items

GUTMAN INDEX OF SOME DERIVED GRAPHS, Splices, Links, and their Edge-Degree Distances, Degree resistance distance of trees with some given parameters, Further properties on the degree distance of graphs, On the reciprocal degree distance of graphs, Some results on the reciprocal sum-degree distance of graphs, Some extremal results on the connective eccentricity index of graphs, On the degree distance of unicyclic graphs with given matching number, Embeddings into almost self-centered graphs of given radius, Reciprocal degree distance and graph properties, On eccentric distance sum and degree distance of graphs, The degree resistance distance of cacti, On the reformulated reciprocal sum-degree distance of graph transformations, On a novel eccentricity-based invariant of a graph, ON THE DEGREE DISTANCE OF SOME COMPOSITE GRAPHS

Cites Work

• Unnamed Item
• The minimum degree distance of graphs of given order and size
• Properties of connected graphs having minimum degree distance
• Some extremal properties of the degree distance of a graph
• Unicyclic and bicyclic graphs having minimum degree distance