Edge geodetic self-decomposition in graphs
2020 ◽
Vol 12
(05)
◽
pp. 2050064
Keyword(s):
Let [Formula: see text] be a simple connected graph of order [Formula: see text] and size [Formula: see text]. A decomposition of a graph [Formula: see text] is a collection of edge-disjoint subgraphs [Formula: see text] of [Formula: see text] such that every edge of [Formula: see text] belongs to exactly one [Formula: see text]. The decomposition [Formula: see text] of a connected graph [Formula: see text] is said to be an edge geodetic self-decomposition if [Formula: see text] for all [Formula: see text]. Some general properties satisfied by this concept are studied.
2021 ◽
Vol 10
(4)
◽
pp. 2115-2129
2007 ◽
Vol 3
(1)
◽
pp. 143-148
◽
Keyword(s):
2019 ◽
Vol 9
(1)
◽
pp. 1421-1425
Keyword(s):
2020 ◽
Vol 12
(04)
◽
pp. 2050052
◽