Find in Library
Search millions of books, articles, and more
Indexed Open Access Databases
On Minimal Geodetic Domination in Graphs
oleh: Nuenay Hearty M., Jamil Ferdinand P.
| Format: | Article |
|---|---|
| Diterbitkan: | University of Zielona Góra 2015-08-01 |
Deskripsi
Let G be a connected graph. For two vertices u and v in G, a u-v geodesic is any shortest path joining u and v. The closed geodetic interval IG[u, v] consists of all vertices of G lying on any u-v geodesic. For S ⊆ V (G), S is a geodetic set in G if ∪u,v∈S IG[u, v] = V (G).