Domination integrity of line splitting graph and central graph of path, cycle and star graphs
SS Mahde, V Mathad - Applications and Applied …, 2016 - digitalcommons.pvamu.edu
SS Mahde, V Mathad
Applications and Applied Mathematics: An International …, 2016•digitalcommons.pvamu.eduThe domination integrity of a connected graph G=(V (G); E (G)) is denoted as DI (G) and
defined by DI (G)= min {| S|+ m (GS)}, where S is a dominating set and m (GS) is the order of
a maximum component of GS. This paper discusses domination integrity of line splitting
graph and central graph of some graphs.
defined by DI (G)= min {| S|+ m (GS)}, where S is a dominating set and m (GS) is the order of
a maximum component of GS. This paper discusses domination integrity of line splitting
graph and central graph of some graphs.
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 (GS) is the order of a maximum component of GS. This paper discusses domination integrity of line splitting graph and central graph of some graphs.
digitalcommons.pvamu.edu
以上显示的是最相近的搜索结果。 查看全部搜索结果