Ordering connected graphs having small degree distances

DOI10.1016/j.dam.2010.05.023zbMath1208.05021OpenAlexW2068376552MaRDI 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

treediametereccentricitydegree distancebistar

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07)

Related Items

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

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