Abstract
A set of vertices X is called irredundant if for every x in X the closed neighborhood N[ x] contains a vertex which is not a member of N[ X- x], the union of the closed neighborhoods of the other vertices. In this paper we show that for circular arc graphs the size of the maximum irredundant set equals the size of a maximum independent set. Variants of irredundancy called oo-irredundance, co-irredundance, and oc-irredundancy are defined using combinations of open and closed neighborhoods. We prove that for circular arc graphs the size of a maximum oo-irredundant set equals 2β ∗ or 2β ∗+1 (depending on parity) where β ∗ is the strong matching number. We also show that for circular arc graphs, the size of a maximum co-irredundant set equals the maximum number of vertices in a set consisting of disjoint K 1' s and K 2' s. Similar results are proven for bipartite graphs.
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.
