On trees with total domination number equal to edge-vertex domination number plus one |
| |
Authors: | B KRISHNAKUMARI Y B VENKATAKRISHNAN MARCIN KRZYWKOWSKI |
| |
Abstract: | An edge e∈E(G) dominates a vertex v∈V(G) if e is incident with v or e is incident with a vertex adjacent to v. An edge-vertex dominating set of a graph G is a set D of edges of G such that every vertex of G is edge-vertex dominated by an edge of D. The edge-vertex domination number of a graph G is the minimum cardinality of an edge-vertex dominating set of G. A subset D?V(G) is a total dominating set of G if every vertex of G has a neighbor in D. The total domination number of G is the minimum cardinality of a total dominating set of G. We characterize all trees with total domination number equal to edge-vertex domination number plus one. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |