On the (M, D) number of a graph

DOI10.4067/S0716-09172019000200255zbMath1442.05160OpenAlexW2947539629MaRDI QIDQ3294993

No author found.

Publication date: 30 June 2020

Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4067/s0716-09172019000200255

zbMATH Keywords

domination numbermonophonic numbergeodetic domination numbermonophonic domination number

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (4)

Connected monophonic domination in graphs ⋮ The geodetic hop domination number of complementary prisms ⋮ Distinct edge geodetic decomposition in graphs ⋮ The edge-to-edge geodetic domination number of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Monophonic numbers of the join and composition of connected graphs
• On the geodetic and geodetic domination numbers of a graph
• A linear algorithm for the domination number of a tree
• The geodetic number of a graph
• On the Steiner, geodetic and hull numbers of graphs
• Dominating a Family of Graphs with Small Connected Subgraphs
• Algorithmic Aspects of Monophonic Convexity

This page was built for publication: On the (M, D) number of a graph