Domination integrity of splitting graph of path and cycle
type: Item
instance of: scholarly article
title: Domination integrity of splitting graph of path and cycle
zbMATH Open document ID: 1264.05097
DOI: 10.1155/2013/795427
author: N. J. Kothari
author: S. K. Vaidya
published in: ISRN Combinatorics
publication date: 2013-06-03T00:00:00Z
review text: Summary: 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.
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6169813
zbMATH Keywords: network expansion
zbMATH Keywords: vulnerability parameter
zbMATH Keywords: dominating set
zbMATH Keywords: dominating integrity
zbMATH Keywords: splitting graph
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2013/795427
OpenAlex ID: W2002753425
Wikidata QID: Q58999352
cites work: Q3789603
cites work: Q3781769
cites work: Q3472139
cites work: Q3490019
cites work: A Note on the Integrity of Middle Graphs
cites work: Integrity of total graphs via certain parameters
cites work: Q2998643
cites work: Q4368728
description: scientific article; zbMATH DE number 6169813