Cargando…
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...
Autores principales: | Vasanthi, R., Subramanian, K. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi Publishing Corporation
2016
|
Materias: | |
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 |
Ejemplares similares
-
Vertex-deleted subgraphs and regular factors from regular graph()
por: Lu, Hongliang, et al.
Publicado: (2011) -
Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs
por: Mkrtchyan, Vahan, et al.
Publicado: (2020) -
TIVC: An Efficient Local Search Algorithm for Minimum Vertex Cover in Large Graphs
por: Zhang, Yu, et al.
Publicado: (2023) -
Presentations for vertex-transitive graphs
por: Georgakopoulos, Agelos, et al.
Publicado: (2021) -
Vertex Separators for Partitioning a Graph
por: Evrendilek, Cem
Publicado: (2008)