Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6416154 | Linear Algebra and its Applications | 2016 | 9 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
MarÃa Robbiano, Katherine Tapia Morales, Bernardo San MartÃn,