Distinct edge geodetic decomposition in graphs

DOI10.22049/cco.2020.26638.1126zbMath1488.05340OpenAlexW3164692910MaRDI QIDQ4957555

No author found.

Publication date: 9 September 2021

Full work available at URL: http://comb-opt.azaruniv.ac.ir/article_14114_9555441344465ec52e1ff6583ab21566.pdf

zbMATH Keywords

star decompositionedge geodetic numberdistinct edge geodetic decompositiondistinct edge geodetic decomposition numberminimum edge geodetic set

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the ascending subgraph decomposition problem for bipartite graphs
• On the ascending star subgraphs decomposition of star forests
• Total restrained geodetic number of graphs
• \(2K_2\)-partition of some classes of graphs
• The restrained geodetic number of a graph
• The upper connected edge geodetic number of a graph
• On the (M, D) 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
• P-Components and the Homogeneous Decomposition of Graphs
• On the edge geodetic and edge geodetic domination numbers of a graph
• Graphs with large geodetic number
• Edge geodetic number of a graph
• Edge geodetic self-decomposition in graphs

This page was built for publication: Distinct edge geodetic decomposition in graphs