Domination integrity of splitting graph of path and cycle (Q1952732)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Domination integrity of splitting graph of path and cycle |
scientific article; zbMATH DE number 6169813
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Domination integrity of splitting graph of path and cycle |
scientific article; zbMATH DE number 6169813 |
Statements
Domination integrity of splitting graph of path and cycle (English)
0 references
3 June 2013
0 references
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.
0 references
network expansion
0 references
vulnerability parameter
0 references
dominating set
0 references
dominating integrity
0 references
splitting graph
0 references
