Degree Distance in Graphs with Forbidden Subgraphs

DOI10.46793/match.90-3.685mMaRDI QIDQ6182445

Phillip Mafuta

Publication date: 25 January 2024

Published in: Match - Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)

zbMATH Keywords

topological indexdegree distanceforbidden subgraph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the degree distance of a graph
• The minimum degree distance of graphs of given order and size
• The vertex PI index and Szeged index of bridge graphs
• Properties of connected graphs having minimum degree distance
• Radius, diameter, and minimum degree
• General multiplicative Zagreb indices of trees
• Some extremal properties of the degree distance of a graph
• Unicyclic and bicyclic graphs having minimum degree distance
• DEGREE DISTANCE AND MINIMUM DEGREE
• Bounds on the leaf number in graphs of girth 4 or 5

This page was built for publication: Degree Distance in Graphs with Forbidden Subgraphs