Connected monophonic domination in graphs

DOI10.1142/S1793830921500294zbMath1475.05098OpenAlexW3088303941MaRDI QIDQ5013476

No author found.

Publication date: 30 November 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830921500294

zbMATH Keywords

dominating setmonophonic setmonophonic domination numberchordless path (\(m\)-path)connected monophonic dominating setconnected monophonic domination number

Mathematics Subject Classification ID

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

Related Items (2)

On connected co-independent domination in the join, corona and lexicographic product of graphs ⋮ Secure equitability in graphs

Cites Work

• Monophonic numbers of the join and composition of connected graphs
• On the geodetic and geodetic domination numbers of a graph
• On the Steiner, geodetic and hull numbers of graphs
• On the (M, D) number of a graph
• Towards a theory of domination in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Connected monophonic domination in graphs