Average distance and connected domination

DOI10.1080/09728600.2023.2183913MaRDI QIDQ6166238zbMATH OpenOpenAlexFDO

Authors Phillip Mafuta, Simon Mukwembi

Publication date 2 August 2023

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1080/09728600.2023.2183913

zbMATH Keywords

connected dominationaverage distance

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12)

Recommendations

• Average distance and domination number revisited
• A note on dominating sets and average distance
• Average distance, connected hub number and connected domination number
• Average distances and distance domination numbers
• Average distance and domination number

Cites work

• scientific article; zbMATH DE number 4041962 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 841632 (Why is no real title available?)
• A note on dominating sets and average distance
• Average distance and domination number
• Average distance and independence number
• Average distance and maximum induced forest
• Average distance, minimum degree, and spanning trees
• Bounds on Gutman index
• Bounds on the leaf number in graphs of girth 4 or 5
• Computing the average distance of an interval graph
• Degree distance and Gutman index of increasing trees
• Degree distance and minimum degree
• Domination in Graphs Applied to Electric Power Networks
• Extremal modified Schultz index of bicyclic graphs
• Extremal university graphs with respect to modified Schultz index
• General multiplicative Zagreb indices of trees
• Graphs with forbidden subgraphs and leaf number
• Gutman index of product graphs
• Hamiltonicity, minimum degree and leaf number
• Lower bounds on the leaf number in graphs with forbidden subgraphs
• Mean distance and minimum degree
• Minimum degree, leaf number, and hamiltonicity
• On minimum degree, leaf number, traceability and Hamiltonicity in graphs
• On some topological indices of the tensor products of graphs
• On spanning cycles, paths and trees
• On the Gutman index and minimum degree
• On the Gutman index and minimum degree of a triangle-free graph
• On the degree distance of a graph
• On the sum of all distances in a graph or digraph
• On the upper bound of Gutman index of graphs
• Properties of connected graphs having minimum degree distance
• Some extremal properties of the degree distance of a graph
• Spanning paths and cycles in triangle-free graphs
• Spanning paths in graphs
• Spanning trees in graphs of minimum degree 4 or 5
• Spanning trees with many leaves and average distance
• Spanning trees with many leaves in cubic graphs
• Steiner degree distance
• The Gutman index of unicyclic graphs
• The average distance and the independence number
• The complexity of the network design problem
• The edge-Wiener index of a graph
• The maximal Gutman index of bicyclic graphs
• The minimum degree distance of graphs of given order and size
• Unicyclic and bicyclic graphs having minimum degree distance

Cited in

(5)

• Average distance and generalised packing in graphs
• A note on dominating sets and average distance
• Average distances and distance domination numbers
• Average distance, connected hub number and connected domination number
• Average distance and domination number revisited

This page was built for publication: Average distance and connected domination

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