On the (M, D) number of a graph

DOI10.4067/S0716-09172019000200255zbMATH Open1442.05160OpenAlexW2947539629MaRDI QIDQ3294993FDOQ3294993

Authors:

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

Recommendations

• Independent double monophonic domination number of a graph
• On the monophonic number of a graph
• Characterization of upper detour monophonic domination number
• Connected monophonic domination in graphs
• Monophonic and geodetic dominations in the join, corona and composition of graphs

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)

Cites Work

• Title not available (Why is that?)
• A linear algorithm for the domination number of a tree
• The geodetic number of a graph
• Title not available (Why is that?)
• Algorithmic Aspects of Monophonic Convexity
• On the Steiner, geodetic and hull numbers of graphs
• Dominating a family of graphs with small connected subgraphs
• Monophonic numbers of the join and composition of connected graphs
• On the geodetic and geodetic domination numbers of a graph

Cited In (5)

• The edge-to-edge geodetic domination number of a graph
• Distinct edge geodetic decomposition in graphs
• The geodetic hop domination number of complementary prisms
• Connected monophonic domination in graphs
• On the parameterm₂(h) for graphs

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

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