All graphs with paired-domination number two less than their order
Let \(G=(V,E)\) be a graph with no isolated vertices. A set \(S\subseteq V\) is a paired-dominating set of \(G\) if every vertex not in \(S\) is adjacent with some vertex in \(S\) and the subgraph induced by \(S\) contains a perfect matching. The paired-domination number \(\gamma_{p}(G)\) of \(G\) i...
I tiakina i:
| Kaituhi matua: | |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
AGH Univeristy of Science and Technology Press
2013-01-01
|
| Rangatū: | Opuscula Mathematica |
| Ngā marau: | |
| Urunga tuihono: | http://www.opuscula.agh.edu.pl/vol33/4/art/opuscula_math_3345.pdf |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|