检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:KONG Qi WANG Li-gong
出 处:《Chinese Quarterly Journal of Mathematics》2017年第3期238-245,共8页数学季刊(英文版)
基 金:Supported by the National Natural Science Foundation of China(11171273); Supported by the Seed Foundation of Innovation and Creation for Graduate Students in Northwestern Polytechnical Uni- versity(Z2016170)
摘 要:A k-cyclic graph is a connected graph of order n and size n + k-1. In this paper, we determine the maximal signless Laplacian spectral radius and the corresponding extremal graph among all C_4-free k-cyclic graphs of order n. Furthermore, we determine the first three unicycles and bicyclic, C_4-free graphs whose spectral radius of the signless Laplacian is maximal. Similar results are obtained for the(combinatorial)A k-cyclic graph is a connected graph of order n and size n + k - 1. In this paper, we determine the maximal signless Laplacian spectral radius and the corresponding extremal graph among all C4-free k-cyclic graphs of order n. Furthermore, we determine the first three unicycles and bicyclic, C4-free graphs whose spectral radius of the signless Laplacian is maximal. Similar results are obtained for the(combinatorial) Laplacian.
关 键 词:k-cyclic graph C4-free signless Laplacian spectral radius Laplacian spectral radius
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.143.110.165