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: | R. Vasanthi, K. Subramanian |
---|---|
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!
|
Similar Items
-
On (a,1)-Vertex-Antimagic Edge Labeling of Regular Graphs
by: Martin Bača, et al.
Published: (2015-01-01) -
On Locating-Dominating Set of Regular Graphs
by: Anuwar Kadir Abdul Gafur, et al.
Published: (2021-01-01) -
Further Results on Total Edge-Vertex Domination
by: Abdulgani Şahin
Published: (2022-01-01) -
Co-Secure Domination Number in Some Graphs
by: Jiatong Cui, et al.
Published: (2024-12-01) -
New Bounds on the Triple Roman Domination Number of Graphs
by: M. Hajjari, et al.
Published: (2022-01-01)