Domination integrity of splitting graph of path and cycle
From MaRDI portal
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.
Recommendations
Cites work
- A Note on the Integrity of Middle Graphs
- Domination integrity of middle graphs
- scientific article; zbMATH DE number 4139795 (Why is no real title available?)
- scientific article; zbMATH DE number 4162911 (Why is no real title available?)
- scientific article; zbMATH DE number 4043858 (Why is no real title available?)
- scientific article; zbMATH DE number 4053662 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Integrity of total graphs via certain parameters
Cited in
(12)- Domination integrity of line splitting graph and central graph of path, cycle and star graphs
- Domination integrity of some path related graphs
- Domination integrity of splitting and degree splitting graphs of some graphs
- Domination weak integrity in graphs
- Domination integrity of total graphs
- Domination integrity of some graph classes
- Total influence number of some splitting graphs
- Vulnerability of some splitting graphs
- Domination parameters of the splitting graph of a graph
- TOTAL DOMINATION INTEGRITY OF WHEEL RELATED GRAPHS
- Strong Domination integrity of shadow graphs of some graphs
- Domination integrity of some new graphs
This page was built for publication: Domination integrity of splitting graph of path and cycle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1952732)