Domination integrity of splitting graph of path and cycle (Q1952732): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q58999352, #quickstatements; #temporary_batch_1714786519576 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3789603 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3781769 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3472139 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3490019 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Note on the Integrity of Middle Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Integrity of total graphs via certain parameters / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2998643 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4368728 / rank | |||
Normal rank | |||
Latest revision as of 11:17, 6 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Domination integrity of splitting graph of path and cycle |
scientific article |
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
