Adjacency matrix;
Signless Laplacian matrix;
Maximal eigenvalue;
Vertex bipartiteness;
Spread of a graph;
LAPLACIAN SPECTRUM;
D O I:
10.1016/j.laa.2015.11.029
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
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 v(b) (G). We consider the set Sigma(k) (n) defined by {G = (V(G), E(G)) : G connected, vertical bar V(G)vertical bar = n and v(b) (G) <= k}. In this work we identify the graph in Sigma(k) (n) with maximum spectral radius and maximum signless Laplacian spectral radius. (C) 2015 Elsevier Inc. All rights reserved.
机构:
South China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R ChinaSouth China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R China
Luo, Zuojuan
Zhou, Bo
论文数: 0引用数: 0
h-index: 0
机构:
South China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R ChinaSouth China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R China
机构:
Lanzhou Univ, Gansu Ctr Appl Math, Sch Math & Stat, Lanzhou 730000, Gansu, Peoples R ChinaLanzhou Univ, Gansu Ctr Appl Math, Sch Math & Stat, Lanzhou 730000, Gansu, Peoples R China
Liang, Yi-Ping
Li, Jianxi
论文数: 0引用数: 0
h-index: 0
机构:
Minnan Normal Univ, Sch Math & Stat, Zhangzhou 363000, Fujian, Peoples R ChinaLanzhou Univ, Gansu Ctr Appl Math, Sch Math & Stat, Lanzhou 730000, Gansu, Peoples R China
Li, Jianxi
Xu, Shou-Jun
论文数: 0引用数: 0
h-index: 0
机构:
Lanzhou Univ, Gansu Ctr Appl Math, Sch Math & Stat, Lanzhou 730000, Gansu, Peoples R ChinaLanzhou Univ, Gansu Ctr Appl Math, Sch Math & Stat, Lanzhou 730000, Gansu, Peoples R China