Open AccessDomination Integrity of Splitting Graph of Path and Cycle
Author(s) -
S. K. Vaidya,
N. J. Kothari
Publication year - 2013
Publication title -
isrn combinatorics
Language(s) - English
Resource type - Journals
ISSN - 2090-8911
DOI - 10.1155/2013/795427
Subject(s) - dominating set , path (computing) , graph , mathematics , graph theory , butterfly graph , connected component , combinatorics , computer science , discrete mathematics , line graph , voltage graph , vertex (graph theory) , programming language
If is a dominating set of a connected graph then the domination integrity isthe minimum of the sum of two parameters, the number of elements in and the orderof the maximum component of . We investigate domination integrity of splittinggraph of path and cycle . This work is an effort to relate network expansion andvulnerability parameter.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom