Skip to main content
Journal ArticleOPEN ACCESS

Domination Integrity of Splitting Graph of Path and Cycle

  • Vaidya S
  • Kothari N
ISRN Combinatorics (2013) 2013 1-7
DOI: 10.1155/2013/795427
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Vaidya, S. K., & Kothari, N. J. (2013). Domination Integrity of Splitting Graph of Path and Cycle. ISRN Combinatorics, 2013, 1–7. https://doi.org/10.1155/2013/795427

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free