Abstract
Abstract- In the study of domination in graphs, relationships between the concepts of maximal independent sets, minimal dominating sets and maximal irredundant sets are used to establish what is known as domination chain of parameters. 0 ir(G) (G) i(G) (G) (G) IR(G) In this paper, starting from the concept of edge cover, six graph theoretic parameters are introduced which obey a chain of inequalities, called as the edge covering chain of the graph G
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of University of Shanghai for Science and Technology
Disclaimer: 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.