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 regular g...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2016-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2016/1029024 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 Qn and H3,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. |
|---|---|
| ISSN: | 2356-6140 1537-744X |