The domination integrity of a simple connected graph G is a measure of vulnerability of a graph. Here we determine the domination integrity of total graphs of path Pn, cycle Cn and star K1,n.
| Primary Language | English |
|---|---|
| Authors | |
| Publication Date | June 1, 2014 |
| Published in Issue | Year 2014 Volume: 4 Issue: 1 |