Ordering connected graphs having small degree distances

DOI10.1016/J.DAM.2010.05.023MaRDI QIDQ602693zbMATH OpenOpenAlexFDO

Authors 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

treediameterdegree distanceeccentricitybistar

Mathematics Subject Classification ID

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

Recommendations

• Ordering connected graphs having small degree distances. II
• Ordering graphs with small index and its application
• Ordering connected graphs by their Kirchhoff indices
• The ordering of the connected graphs with the smallest Laplacian spectral radii
• Order of a Graph with given Vertex and Edge Connectivity and Minimum Degree
• The minimum degree distance of graphs of given order and size
• Ordering trees and graphs with few cycles by algebraic connectivity
• Graphs of given order and size and minimum algebraic connectivity
• On ordered graphs and graph orderings
• Minimum order graphs with specified diameter, connectivity, and regularity

Cites work

• scientific article; zbMATH DE number 5010975 (Why is no real title available?)
• Properties of connected graphs having minimum degree distance
• Some extremal properties of the degree distance of a graph
• The minimum degree distance of graphs of given order and size
• Unicyclic and bicyclic graphs having minimum degree distance

Cited in

(20)

• Unicyclic connected graphs having smallest degree distances
• On a novel eccentricity-based invariant of a graph
• On eccentric distance sum and degree distance of graphs
• On the reciprocal degree distance of graphs
• Reciprocal degree distance and graph properties
• Some results on the reciprocal sum-degree distance of graphs
• Connected graphs of diameter two having small degree distances
• Embeddings into almost self-centered graphs of given radius
• ON THE DEGREE DISTANCE OF SOME COMPOSITE GRAPHS
• The bicyclic graphs with minimal degree distance
• The degree resistance distance of cacti
• Gutman index of some derived graphs
• Ordering graphs with small index and its application
• Splices, links, and their edge-degree distances
• Further properties on the degree distance of graphs
• On the degree distance of unicyclic graphs with given matching number
• Degree resistance distance of trees with some given parameters
• Some extremal results on the connective eccentricity index of graphs
• Ordering connected graphs having small degree distances. II
• On the reformulated reciprocal sum-degree distance of graph transformations

This page was built for publication: Ordering connected graphs having small degree distances

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