New footprints of bondage number of connected unicyclic and line graphs
The bondage number of a non-empty graph G is the smallest number of edges whose removal from G results in a graph with larger domination number of G. In this paper, we prove that the bondage number of connected unicyclic graphs is less than or equal to three. Also, we characterize the class of uni...
| Foilsithe in: | Asia Life Sciences : the Asian International Journal of Life Sciences Vol. 26, no. 2 (Jul. 2017 - Dec. 2017), 321-326 |
|---|---|
| Príomhchruthaitheoir: | |
| Rannpháirtithe: | , |
| Formáid: | Alt |
| Teanga: | English |
| Foilsithe / Cruthaithe: |
2017
|
| Ábhair: |