Average distance and connected domination

DOI10.1080/09728600.2023.2183913zbMATH Open1519.05191OpenAlexW4361269719MaRDI QIDQ6166238FDOQ6166238

Authors: Phillip Mafuta, Simon Mukwembi 

Publication date: 2 August 2023

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

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

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

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)

Cites Work

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

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)