Edge Detour Monophonic Number of a Graph
For a connected graph G of order at least two, an edge detour monophonic set of G is a set S of vertices such that every edge of G lies on a detour monophonic path joining some pair of vertices in S. The edge detour monophonic number of G is the minimum cardinality of its edge detour monophonic sets...
Guardado en:
Autores principales: | Santhakumaran,A. P., Titus,P, Ganesamoorthy,K, Balakrishnan,P |
---|---|
Lenguaje: | English |
Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2013
|
Materias: | |
Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172013000200007 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Upper Edge Detour Monophonic Number of a Graph
por: Titus,P, et al.
Publicado: (2014) -
The total detour monophonic number of a graph
por: Santhakumaran,A. P., et al.
Publicado: (2017) -
Edge-to-vertex m-detour monophonic number of a graph
por: Santhakumaran,A. P., et al.
Publicado: (2018) -
Characterization of Upper Detour Monophonic Domination Number
por: Khayyoom,M. Mohammed Abdul
Publicado: (2020) -
Connected edge monophonic number of a graph
por: Santhakumaran,A P, et al.
Publicado: (2013)