Edge Domination and Secure Edge Domination in Mycielski Graph of Trees
The secure edge dominating set of a graph G is an edge dominating set F with the property that for each edge e ∈ E − F , there exists f ∈ F adjacent to e such that ( F − { f } ) ∪ { e } is an edge dominating set. In this paper, we obtained upper bounds for edge domination and secure edge domination number for Mycielski of a tree.
Authors
- M. R. Chithra
- P G Nayana
Publication Details
- Journal
- Ars Combinatoria
- Published
- 2024-09-30
- DOI
- https://doi.org/10.61091/ars-160-16
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00