On the spectral radius of bipartite graphs which are nearly complete

被引：0
|
作者：
Kinkar Chandra Das
Ismail Naci Cangul
Ayse Dilek Maden
Ahmet Sinan Cevik
机构：
[1] Sungkyunkwan University,Department of Mathematics
[2] Uludag University,Department of Mathematics, Faculty of Arts and Science
[3] Selcuk University,Department of Mathematics, Faculty of Science
来源：
Journal of Inequalities and Applications | / 2013卷
关键词：
bipartite graph; adjacency matrix; spectral radius;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
For p,q,r,s,t∈Z+ with rt≤p and st≤q, let G=G(p,q;r,s;t) be the bipartite graph with partite sets U={u1,…,up} and V={v1,…,vq} such that any two edges ui and vj are not adjacent if and only if there exists a positive integer k with 1≤k≤t such that (k−1)r+1≤i≤kr and (k−1)s+1≤j≤ks. Under these circumstances, Chen et al. (Linear Algebra Appl. 432:606-614, 2010) presented the following conjecture:
引用
收藏
相关论文
共 50 条
12345