Abstract

Sciriha first proposed the notion of minimal configurations. A graph G with nullity one is called a minimal configuration if no two vertices in the periphery are adjacent and deletion of any vertex in the periphery increases the nullity. Recently, minimal configurations in special class of graphs, such as trees and unicyclic graphs, have been studied. The set of bicyclic graphs, denoted by , can be partitioned into two subsets: the set ℬ* of graphs which contain induced ∞-graphs, and the set ℬ** of graphs which contain induced θ-graphs. Nath described the minimal configurations in ℬ*. In this article, we will describe the minimal configurations in the set ℬ**. These results together give a complete characterization of the minimal configurations in .

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

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.