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
_version_ 1782426602097868800
author Vasanthi, R.
Subramanian, K.
author_facet Vasanthi, R.
Subramanian, K.
author_sort Vasanthi, R.
collection PubMed
description 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).
format Online
Article
Text
id pubmed-4828551
institution National Center for Biotechnology Information
language English
publishDate 2016
publisher Hindawi Publishing Corporation
record_format MEDLINE/PubMed
spelling pubmed-48285512016-04-26 On Vertex Covering Transversal Domination Number of Regular Graphs Vasanthi, R. Subramanian, K. ScientificWorldJournal Research Article 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). Hindawi Publishing Corporation 2016 2016-03-29 /pmc/articles/PMC4828551/ /pubmed/27119089 http://dx.doi.org/10.1155/2016/1029024 Text en Copyright © 2016 R. Vasanthi and K. Subramanian. https://creativecommons.org/licenses/by/4.0/ This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
spellingShingle Research Article
Vasanthi, R.
Subramanian, K.
On Vertex Covering Transversal Domination Number of Regular Graphs
title On Vertex Covering Transversal Domination Number of Regular Graphs
title_full On Vertex Covering Transversal Domination Number of Regular Graphs
title_fullStr On Vertex Covering Transversal Domination Number of Regular Graphs
title_full_unstemmed On Vertex Covering Transversal Domination Number of Regular Graphs
title_short On Vertex Covering Transversal Domination Number of Regular Graphs
title_sort on vertex covering transversal domination number of regular graphs
topic Research Article
url 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
work_keys_str_mv AT vasanthir onvertexcoveringtransversaldominationnumberofregulargraphs
AT subramaniank onvertexcoveringtransversaldominationnumberofregulargraphs

Ejemplares similares