The total double geodetic number of a graph
Abstract For a connected graph G of order n, a set S of vertices is called a double geodetic set of G if for each pair of vertices x, y in G there exist vertices u, v ∈ S such that x, y ∈ I[u, v]. The double geodetic number dg(G) is the minimum cardinality of a double geodetic se...
Guardado en:
Autores principales: | Santhakumaran,A. P., Jebaraj,T. |
---|---|
Lenguaje: | English |
Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2020
|
Materias: | |
Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172020000100167 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Comment on "Edge Geodetic Covers in Graphs
por: Santhakumaran,A. P., et al.
Publicado: (2015) -
The edge-to-edge geodetic domination number of a graph
por: John,J., et al.
Publicado: (2021) -
On the upper geodetic global domination number of a graph
por: Lenin Xaviour,X., et al.
Publicado: (2020) -
The upper open monophonic number of a graph
por: Santhakumaran,A. P., et al.
Publicado: (2014) -
Connected edge monophonic number of a graph
por: Santhakumaran,A P, et al.
Publicado: (2013)