The edge-to-edge geodetic domination number of a graph
Abstract: Let G = (V, E) be a connected graph with at least three vertices. A set S ⊆ E(G) is called an edge-to-edge geodetic dominating set of G if S is both an edge-to-edge geodetic set of G and an edge dominating set of G. The edge-to-edge geodetic domination number γgee(G) of...
Guardado en:
Autores principales: | John,J., Flower,V. Sujin |
---|---|
Lenguaje: | English |
Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2021
|
Materias: | |
Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000300635 |
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) -
Connected edge monophonic number of a graph
por: Santhakumaran,A P, et al.
Publicado: (2013) -
On the upper geodetic global domination number of a graph
por: Lenin Xaviour,X., et al.
Publicado: (2020) -
On the (M, D) number of a graph
por: John,J., et al.
Publicado: (2019) -
Complementary nil vertex edge dominating sets
por: Siva Rama Raju,S. V., et al.
Publicado: (2015)