Complementary nil vertex edge dominating sets
Dominating sets play a vital role in day-to-day life problems. For-providing effective services in a location, central points are to be identified. This can easily be achieved by graph theoretic techniques. Such graphs and relevant parameters are introduced and extensively studied. One such paramete...
Guardado en:
Autores principales: | Siva Rama Raju,S. V., Nagaraja Rao,I. H. |
---|---|
Lenguaje: | English |
Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2015
|
Materias: | |
Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172015000100001 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
A note on complementary tree domination number of a tree
por: Krishnakumari,B, et al.
Publicado: (2015) -
Vertex cover and edge-vertex domination in tres
por: Senthilkumar,B., et al.
Publicado: (2021) -
Total domination and vertex-edge domination in tres
por: Venkatakrishnan,Y. B., et al.
Publicado: (2019) -
Trees with vertex-edge roman domination number twice the domination number minus one
por: Naresh Kumar,H., et al.
Publicado: (2020) -
The edge-to-edge geodetic domination number of a graph
por: John,J., et al.
Publicado: (2021)