Domination Integrity of Some Special Graphs
2020 ◽
Vol 8
(4S5)
◽
pp. 40-45
A major importance is given to the stability of a network by its users and designers. Domination Integrity is one of the parameter used to determine the network’s vulnerability and its defined for a connected graph G as “ DI(G) = min{| X | +m(G - X) : X is a dominating set} wh ere m(G-X) is the order of maximum component of G-X”, by Sundareswaran and Swaminathan. Here we investigate the domination integrity of Tadpole graph, Lollipop graph and a line graph of composition of nP and P2
1977 ◽
Vol 24
(2)
◽
pp. 170-183
Keyword(s):
Keyword(s):
2020 ◽
Vol 12
(04)
◽
pp. 2050052
◽
Keyword(s):
2017 ◽
Vol 09
(05)
◽
pp. 1750069
◽
Keyword(s):