Abstract
Let P be a graph theoretic property concerning subsets of the vertex set V, which is either hereditary or super hereditary. We associate with this property P five graph theoretic parameters, namely a minimum parameter, a maximum parameter, a max-min parameter, a min-max parameter and a partition parameter. We initiate a study of these parameters for the properties of independence, domination and irredundance.
Sign-in/Register to access full text options 
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 callMore From: AKCE International Journal of Graphs and Combinatorics
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.
