The forcing open monophonic number of a graph
From MaRDI portal
Publication:2812623
Recommendations
- The forcing total monophonic number of a graph
- The forcing connected vertex monophonic number of a graph
- The forcing edge monophonic number of a graph
- Forcing total outer connected monophonic number of a graph
- The forcing vertex detour monophonic number of a graph
- The upper open monophonic number of a graph
- scientific article; zbMATH DE number 7722331
- The forcing edge fixing edge-to-vertex monophonic number of a graph
- Total and forcing total edge-to-vertex monophonic number of a graph
- On the forcing hull and forcing monophonic hull numbers of graphs
Cites work
- scientific article; zbMATH DE number 1933222 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- Geodomination in graphs
- Graphs with specified radius and diameter
- On geodomination in graphs
- On the open geodetic number of a graph
- The upper open monophonic number of a graph
Cited in
(6)- scientific article; zbMATH DE number 7722331 (Why is no real title available?)
- The forcing connected vertex monophonic number of a graph
- scientific article; zbMATH DE number 7511520 (Why is no real title available?)
- The forcing edge monophonic number of a graph
- The forcing total monophonic number of a graph
- Forcing total outer connected monophonic number of a graph
This page was built for publication: The forcing open monophonic number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2812623)