On the (M, D) number of a graph
From MaRDI portal
Publication:3294993
Recommendations
Cites work
- scientific article; zbMATH DE number 5904664 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- A linear algorithm for the domination number of a tree
- Algorithmic Aspects of Monophonic Convexity
- Dominating a family of graphs with small connected subgraphs
- Monophonic numbers of the join and composition of connected graphs
- On the Steiner, geodetic and hull numbers of graphs
- On the geodetic and geodetic domination numbers of a graph
- The geodetic number of a graph
Cited in
(8)- 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
- Independent double monophonic domination number of a graph
- Monophonic and geodetic dominations in the join, corona and composition of graphs
- Characterization of upper detour monophonic domination number
- On the parameterm2(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)