Código QR

On Minimal Geodetic Domination in Graphs

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).

Gardado en:
Detalles Bibliográficos
Principais autores: Nuenay Hearty M., Jamil Ferdinand P.
Formato: Artigo
Idioma:Inglês
Publicado: University of Zielona Góra 2015-08-01
Series:Discussiones Mathematicae Graph Theory
Assuntos:
Acceso en liña:https://doi.org/10.7151/dmgt.1803
Tags: Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!