Total domination and vertex-edge domination in trees.
Author
Y. B., Venkatakrishnan
Hari, Naresh Kumar
Chidambaram, Natarajan
Abstract
A vertex v of a graph G = (V,E) is said to ve-dominate every edge incident to v, as well as every edge adjacent to these incident edges. A set S ⊆ V is a vertex-edge dominating set if every edge of E is ve-dominated by at least one vertex of S. The minimum cardinality of a vertex-edge dominating set of G is the vertex-edge domination number γve(G) . In this paper we prove (γt(T)−ℓ+1)/2 ≤ γve(T) ≤(γt(T)+ℓ−1)/2 and characterize trees attaining each of these bounds.
Metadata
Show full item recordRelated items
Showing items related by title, author, creator and subject.
-
Simulation Dominated Approach versus Video Dominated Approach in Teaching Consecutive Interpreting to Undergraduates: An Exploratory Comparison Study
Li, Xiangdong. Onomázein ; No. 44: 2019; 106-131 -
Prioritizing the Relative Dominance of Drivers for Intellectual Entrepreneuring Through the Tertiary Knowledge Industry.
Agwe, Jonathan N.; Sharif, Nawaz M.. Journal of Technology Management & Innovation; Vol. 2 No. 4 (2007); 20-43 -
Legislación laboral y organización productiva. jornada de trabajo y descanso dominical en chile: 1901 - 1925
Juan Carlos Yáñez Andrade; Universidad Mayor. Revista de Estudios Histórico-Jurídicos; N° 26 (2004)