Abstract
The domination integrity of a connected graph G = (V (G);E(G)) is denoted as DI(G) and defined by DI(G) = min{|S| + m(G - S)}, where S is a dominating set and m(G-S) is the order of a maximum component of G-S. This paper discusses domination integrity of line splitting graph and central graph of some graphs.
Recommended Citation
Mahde, Sultan S. and Mathad, Veena
(2016).
Domination Integrity of Line Splitting Graph and Central Graph of Path, Cycle and Star Graphs,
Applications and Applied Mathematics: An International Journal (AAM), Vol. 11,
Iss.
1, Article 28.
Available at:
https://digitalcommons.pvamu.edu/aam/vol11/iss1/28