| Autor: |
Roushini Leely Pushpam, P., Priya Bhanthavi, K. |
| Předmět: |
|
| Zdroj: |
Discrete Mathematics, Algorithms & Applications; Oct2024, Vol. 16 Issue 7, p1-15, 15p |
| Abstrakt: |
A set S ⊆ V of vertices in a graph G = (V , E) is called a dominating set if every vertex in V − S is adjacent to a vertex in S. Hamid defined a dominating set which intersects every maximum independent set in G to be an independent transversal dominating set. The minimum cardinality of an independent transversal dominating set is called the independent transversal domination number of G and is denoted by γ it (G). In this paper we prove that for trees T , γ it (T) is bounded above by ⌈ n 2 ⌉ and characterize the extremal trees. Further, we characterize the class of all trees whose independent transversal domination number does not alter owing to the deletion of an edge. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
