Mathematical Theory and Modeling
Characterization of Trees with Equal Total Edge Domination and Double Edge Domination Numbers
Abstract
A total edge dominating set of a graph is a set of edges of such that the sub graph has no isolated edges. The total edge domination number of denoted by, is the minimum cardinality of a total edge dominating set of. Further, the set is said to be double edge dominating set of graph. If every edge of is dominated by at least two edges of. The double edge domination number of, denoted by, , is the minimum cardinality of a double edge dominating set of . In this paper, we provide a constructive characterization of trees with equal total edge domination and double edge domination numbers.
Key words: Trees, Total edge domination number, Double edge domination number.
To list your conference here. Please contact the administrator of this platform.
Paper submission email: MTM@iiste.org
ISSN (Paper)2224-5804 ISSN (Online)2225-0522
Please add our address "contact@iiste.org" into your email contact list.
This journal follows ISO 9001 management standard and licensed under a Creative Commons Attribution 3.0 License.
Copyright © www.iiste.org