Distinct edge geodetic decomposition in graphs
From MaRDI portal
Publication:4957555
Recommendations
Cites work
- \(2K_2\)-partition of some classes of graphs
- Designs from graph invariants
- Edge geodetic covers in graphs
- Edge geodetic number of a graph
- Edge geodetic self-decomposition in graphs
- Graphs with large geodetic number
- scientific article; zbMATH DE number 398969 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- scientific article; zbMATH DE number 847135 (Why is no real title available?)
- On the (M, D) number of a graph
- On the ascending star subgraphs decomposition of star forests
- On the ascending subgraph decomposition problem for bipartite graphs
- On the edge geodetic and edge geodetic domination numbers of a graph
- On The Edge Geodetic Number Of A Graph
- P-Components and the Homogeneous Decomposition of Graphs
- The connected edge geodetic number of a graph
- The restrained 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
- Total restrained geodetic number of graphs
Cited in
(9)- scientific article; zbMATH DE number 1292538 (Why is no real title available?)
- Edge Conflicts do not Determine Geodesics in the Associahedron
- The edge geodetic self decomposition number of a graph
- Geodetic even decomposition of graphs
- Geometric path decomposition of graphs
- Edge geodetic self-decomposition in graphs
- Extreme outer connected monophonic graphs
- Edge geodetic sequence in graphs
- The edge geodetic fault tolerant domination number of a graph
This page was built for publication: Distinct edge geodetic decomposition in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4957555)