Strong geodomination in graphs
A pair \(x\), \(y\) of vertices in a nontrivial connected graph \(G\) is said to geodominate a vertex \(v\) of \(G\) if either \(v \in \{x, y\}\) or \(v\) lies in an \(x - y\) geodesic of \(G\). A set \(S\) of vertices of \(G\) is a geodominating set if every vertex of \(G\) is geodominated by some...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AGH Univeristy of Science and Technology Press
2008-01-01
|
| Series: | Opuscula Mathematica |
| Subjects: | |
| Online Access: | http://www.opuscula.agh.edu.pl/vol28/3/art/opuscula_math_2820.pdf |