Domination Integrity of Splitting Graph of Path and Cycle. (16th January 2013)

• Record Type: Journal Article
• Authors: Vaidya, Samir K.; Kothari, Nirang J.
• Other Names: da Fonseca C. Academic Editor.; Dondi R. Academic Editor.; Sotirov R. Academic Editor.
• Is Part Of: ISRN combinatorics. Volume 2013(2013)
• Publication Date: 2013-01-16
• Subjects: Combinatorial analysis -- Periodicals; Combinatorial analysis; Electronic journals; Periodicals; 511.6
• DOI: 10.1155/2013/795427
• Languages: English
• ISSNs: 2090-8911

Abstract

Abstract : If S is a dominating set of a connected graph G then the domination integrity is the minimum of the sum of two parameters, the number of elements in S and the order of the maximum component of G − S . We investigate domination integrity of splitting graph of path P n and cycle C n . This work is an effort to relate network expansion and vulnerability parameter.