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...
Main Authors: | R. Vasanthi, K. Subramanian |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2016-01-01
|
Series: | The Scientific World Journal |
Online Access: | http://dx.doi.org/10.1155/2016/1029024 |
Similar Items
-
Dominating Vertex Covers: The Vertex-Edge Domination Problem
by: Klostermeyer William F., et al.
Published: (2021-02-01) -
Counting the Number of Vertex Covers in a Trapezoid Graph
by: Yung-Jui Chen, et al.
Published: (2009) -
Bounds for graph energy in terms of vertex covering and clique numbers
by: Hilal A. Ganie, et al.
Published: (2019-10-01) -
Effect of vertex deletion on the weak Roman domination number of a graph
by: P. Roushini Leely Pushpam, et al.
Published: (2019-08-01) -
Effect of vertex deletion on the weak Roman domination number of a graph
by: P. Roushini Leely Pushpam, et al.
Published: (2019-08-01)