Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
