The edge-to-edge geodetic domination number of a graph
From MaRDI portal
Publication:5027740
Recommendations
Cites work
- A new lower bound on the domination number of a graph
- An extremal problem for edge domination insensitive graphs
- Edge Dominating Sets in Graphs
- Edge domination in graphs
- Edge domination in the lexico and cart products of graphs
- Edge geodetic self-decomposition in graphs
- scientific article; zbMATH DE number 3674114 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1933222 (Why is no real title available?)
- On edge domination numbers of graphs
- On the (M, D) number of a graph
- On the geodetic and geodetic domination numbers of a graph
- On the geodetic number of a graph
- The detour domination number of a graph
- The lower and upper forcing geodetic numbers of block--cactus graphs
- The upper connected edge geodetic number of a graph
Cited in
(8)- The edge fixed geodomination number of a graph
- scientific article; zbMATH DE number 5834292 (Why is no real title available?)
- scientific article; zbMATH DE number 5707409 (Why is no real title available?)
- scientific article; zbMATH DE number 7460068 (Why is no real title available?)
- scientific article; zbMATH DE number 7303978 (Why is no real title available?)
- On the edge geodetic and edge geodetic domination numbers of a graph
- The complement connected edge geodetic number of a graph
- On the geodetic and geodetic domination numbers of a graph
This page was built for publication: The edge-to-edge geodetic domination number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5027740)