检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Xueyi Huang Qiongxiang Huang
机构地区:[1]School of Mathematics and Statistics, Zhengzhou University Zhengzhou 450001, China [2]College of Mathematics and Systems Science, Xinjiang University Urumqi 830046, China
出 处:《Algebra Colloquium》2019年第1期65-82,共18页代数集刊(英文版)
基 金:This work is supported by the National Natural Science Foundation of China (grants No. 11671344, 11531011 and 11701492).
摘 要:We characterize all connected graphs with exactly three distinct normalized Laplacian eigenvalues among which one is equal to 1, and determine all connected bipartite graphs with at least one vertex of degree 1 having exactly four distinct normalized Laplacian eigenvalues. In addition, we find all unicyclic graphs with three or four distinct normalized Laplacian eigenvalues.
关 键 词:normalized LAPLACIAN eigenvalue BIPARTITE GRAPH symmetrie BIBD unicyclic GRAPH HADAMARD matrix
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.139.238.74