Abstract
AbstractFor a given graphical invariant π, a sequence (ao, a1,…, an) of positive integers is said to be π‐feasible if there exists a graph G with distinguished vertices ν1, ν2,…, νn such that π(G) = ao and π(G −ν1 −ν2 −…−νi) = ai for i = 1, 2,…,n. In this paper, we investigate π‐feasible sequences for the irredundance, domination, and independence numbers of a graph.
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.
