Edge geodetic self-decomposition in graphs

DOI10.1142/S1793830920500640zbMath1457.05030OpenAlexW3034415703MaRDI QIDQ5858173

No author found.

Publication date: 9 April 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830920500640

zbMATH Keywords

decompositiondistanceedge geodetic numberedge geodetic self-decomposition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Related Items (4)

Unnamed Item ⋮ The geodetic hop domination number of complementary prisms ⋮ Distinct edge geodetic decomposition in graphs ⋮ The edge-to-edge geodetic domination number of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comment on "Edge Geodetic Covers in Graphs
• The upper connected edge geodetic number of a graph
• The upper edge geodetic number and the forcing edge geodetic number of a graph
• On The Edge Geodetic Number Of A Graph
• Multidecompositions of line graphs of complete graphs
• Decompositions of some regular graphs into unicyclic graphs of order five
• On the edge geodetic and edge geodetic domination numbers of a graph
• Edge geodetic number of a graph

This page was built for publication: Edge geodetic self-decomposition in graphs