The edge geodetic self decomposition number of a graph
Keyword(s):
Let G = (V, E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint sub graphs G1, G2, ..., Gn of G such that every edge of G belongs to exactly one Gi , (1 ≤ i ≤ n) . The decomposition π = {G1, G2, ....Gn } of a connected graph G is said to be an edge geodetic self decomposi- tion if ge (Gi ) = ge (G), (1 ≤ i ≤ n).The maximum cardinality of π is called the edge geodetic self decomposition number of G and is denoted by πsge (G), where ge (G) is the edge geodetic number of G. Some general properties satisfied by this concept are studied. Connected graphs which are edge geodetic self decomposable are characterized.
2020 ◽
Vol 12
(05)
◽
pp. 2050064
Keyword(s):
2019 ◽
Vol 12
(01)
◽
pp. 2050004
Keyword(s):
2018 ◽
Vol 10
(05)
◽
pp. 1850069
Keyword(s):
2020 ◽
Vol 39
(6)
◽
pp. 1627-1647
Keyword(s):
2019 ◽
Vol 8
(4)
◽
pp. 8723-8728
Keyword(s):
Keyword(s):
2017 ◽
2020 ◽
Vol 12
(02)
◽
pp. 2050029
Keyword(s):
2019 ◽
Vol 8
(10S)
◽
pp. 297-300
Keyword(s):