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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
