Table of Contents
ISRN Combinatorics
Volume 2013 (2013), Article ID 795427, 7 pages
http://dx.doi.org/10.1155/2013/795427
Research Article

Domination Integrity of Splitting Graph of Path and Cycle

1Department of Mathematics, Saurashtra University, Rajkot 360005, Gujarat, India
2B. H. Gardi College of Engineering and Technology, P.O. Box 215, Rajkot 360001, Gujarat, India

Received 9 October 2012; Accepted 19 November 2012

Academic Editors: C. da Fonseca, R. Dondi, and R. Sotirov

Copyright © 2013 Samir K. Vaidya and Nirang J. Kothari. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

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