Degree Distance in Graphs with Forbidden Subgraphs

DOI10.46793/MATCH.90-3.685MMaRDI QIDQ6182445zbMATH OpenFDO

Authors Phillip Mafuta

Publication date 25 January 2024

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

Full work available at URL https://doi.org/10.46793/MATCH.90-3.685M

zbMATH Keywords

degree distancetopological indexforbidden subgraph

Mathematics Subject Classification ID

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

Recommendations

• Degree distance and minimum degree
• On the degree distance of a graph
• scientific article; zbMATH DE number 6739956
• Degree distance and vertex-connectivity
• Radius, diameter, and minimum degree

Cites work

• scientific article; zbMATH DE number 6739956 (Why is no real title available?)
• Bounds on the leaf number in graphs of girth 4 or 5
• Degree distance and minimum degree
• General multiplicative Zagreb indices of trees
• On the Gutman index and minimum degree of a triangle-free graph
• On the degree distance of a graph
• Properties of connected graphs having minimum degree distance
• Radius, diameter, and minimum degree
• Some extremal properties of the degree distance of a graph
• Steiner degree distance
• The minimum degree distance of graphs of given order and size
• The vertex PI index and Szeged index of bridge graphs
• Unicyclic and bicyclic graphs having minimum degree distance

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

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