On Vertex Covering Transversal Domination Number of Regular Graphs

A simple graph G = (V, E) is said to be r-regular if each vertex of G is of degree r. The vertex covering transversal domination number γ (vct)(G) is the minimum cardinality among all vertex covering transversal dominating sets of G. In this paper, we analyse this parameter on different kinds of reg...

Descripción completa

Detalles Bibliográficos
Autores principales: Vasanthi, R., Subramanian, K.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi Publishing Corporation 2016
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4828551/
https://www.ncbi.nlm.nih.gov/pubmed/27119089
http://dx.doi.org/10.1155/2016/1029024
Descripción
Sumario:A simple graph G = (V, E) is said to be r-regular if each vertex of G is of degree r. The vertex covering transversal domination number γ (vct)(G) is the minimum cardinality among all vertex covering transversal dominating sets of G. In this paper, we analyse this parameter on different kinds of regular graphs especially for Q (n) and H (3,n). Also we provide an upper bound for γ (vct) of a connected cubic graph of order n ≥ 8. Then we try to provide a more stronger relationship between γ and γ (vct).

Ejemplares similares