Edge geodetic self-decomposition in graphs
From MaRDI portal
Recommendations
Cites work
- Comment on ``Edge geodetic covers in graphs
- Decompositions of some regular graphs into unicyclic graphs of order five
- Designs from graph invariants
- Edge geodetic covers in graphs
- Edge geodetic number of a graph
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- Multidecompositions of line graphs of complete graphs
- On the edge geodetic and edge geodetic domination numbers of a graph
- On The Edge Geodetic Number Of A Graph
- The connected edge geodetic number of a graph
- The upper connected edge geodetic number of a graph
- The upper edge geodetic number and the forcing edge geodetic number of a graph
Cited in
(13)- scientific article; zbMATH DE number 1292538 (Why is no real title available?)
- Edge Conflicts do not Determine Geodesics in the Associahedron
- Distinct edge geodetic decomposition in graphs
- The edge geodetic self decomposition number of a graph
- On the complement connected Steiner number of a graph
- The geodetic hop domination number of complementary prisms
- The edge-to-edge geodetic domination number of a graph
- Geodetic even decomposition of graphs
- Geometric path decomposition of graphs
- The forcing geodetic global domination number of a graph
- Edge geodetic sequence in graphs
- Geodetic number of cyclic graphs
- The edge geodetic fault tolerant domination number of a graph
This page was built for publication: Edge geodetic self-decomposition in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5858173)