Abstract
Given a graph G. The fewest number of vertices whose deletion yields a bipartite graph from G was defined by S. Fallat and Yi-Zheng Fan to be the vertex bipartiteness of G and it is denoted by υb(G). We consider the set Σk(n) defined by{G=(V(G),E(G)):G connected,|V(G)|=n and υb(G)≤k}. In this work we identify the graph in Σk(n) with maximum spectral radius and maximum signless Laplacian spectral radius.
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.
