|本期目录/Table of Contents|

[1]马小玲.4-玫瑰图的拉普拉斯谱刻画[J].厦门大学学报(自然科学版),2019,58(04):550-555.[doi:10.6043/j.issn.0438-0479.201805025]
 MA Xiaoling.Laplacian spectral characterization of 4-rose graphs[J].Journal of Xiamen University(Natural Science),2019,58(04):550-555.[doi:10.6043/j.issn.0438-0479.201805025]
点击复制

4-玫瑰图的拉普拉斯谱刻画(PDF/HTML)
分享到:

《厦门大学学报(自然科学版)》[ISSN:0438-0479/CN:35-1070/N]

卷:
58卷
期数:
2019年04期
页码:
550-555
栏目:
研究论文
出版日期:
2019-07-28

文章信息/Info

Title:
Laplacian spectral characterization of 4-rose graphs
文章编号:
0438-0479(2019)04-0550-06
作者:
马小玲
新疆大学数学与系统科学学院,新疆 乌鲁木齐 830046
Author(s):
MA Xiaoling
College of Mathematics and System Sciences,Xinjiang University,Urumqi 830046,China
关键词:
4-玫瑰图 拉普拉斯谱 拉普拉斯特征多项式
Keywords:
4-rose graph Laplacian spectrum Laplacian characteristic polynomials
分类号:
O 157.5
DOI:
10.6043/j.issn.0438-0479.201805025
文献标志码:
A
摘要:
p-玫瑰图是指p个圈共享一个公共点而组成的图.刘奋进等证明了所有的3-玫瑰图是由它的拉普拉斯谱确定的(简记为DLS),同时,他们猜测所有的p-玫瑰图都是DLS.在此基础上,该文给出了4-玫瑰图的拉普拉斯特征多项式,证明了上述猜想当p=4时是成立的,即所有的4-玫瑰图都是由它的拉普拉斯谱确定的.
Abstract:
A p-rose graph is a graph consisting of p cycles sharing a com-mon vertex.Liu,et al proved that all 3-rose graphs were determined by their Laplacian spectra(DLS for brevity)and conjectured that all p-rose graphs(p≥3)were DLS.In this paper,the Laplacian characteristic polynomials of 4-rose graph first are given,and then the aforementioned conjecture is proved to be valid for p=4.In other words,all 4-rose graphs are determined by their Laplacian spectra.

参考文献/References:

[1] HARARY F.Graph theory[M].New Jersey:Addison Wesley,1969:150-154.
[2] CVETKOVI’C D M,ROWLINSON P,SIMI’C S.An introduction to the theory of graph spectra[M].New York:Cambridge University,2010:8-38.
[3] GU··NTHARD H H,PRIMAS H.Zusammenhang von graphtheorie und mo-theotie von molekeln mit systemen konjugierter bindungen[J].Helv Chim Acta,1956,39:1645-1653.
[4] VAN DAM E R,HAEMERS W H.Which graphs are determined by their spectrum?[J].Linear Algebra Appl,2003,373:241-272.
[5] WANG J F,HUANG Q,BELARDO F,et al.On the spectral characterizations of ∞-graphs[J].Discrete Math,2010,310:1845-1855.
[6] LIU F J,HUANG Q,Wang J,et al.The spectral characterization of ∞-graphs[J].Linear Algebra Appl,2012,437:1482-1502.
[7] WANG J F,HUANG Q,BELARDO F.On the spectral characterizations of 3-rose graphs[J].Util Math,2013,91:33-46.
[8] WANG W,LI F,LU H L,et al.Graphs determined by their generalized characteristic polynomials[J].Linear Algebra Appl,2011,434:1378-1387.
[9] LIU X,ZHANG Y,GUI X.The multi-fan graphs are determined by their Laplacian spectra[J].Discrete Math,2008,308:4267-4271.
[10] VAN DAM E R,HAEMERS W H.Developments on the spectral characterizations of graphs[J].Discrete Math,2009,309:576-586.
[11] LIU F J,HUANG Q.Laplacian spectral characterization of 3-rose graphs[J].Linear Algebra Appl,2013,439:2914-2920.
[12] GUO J.A conjecture on the algebraic connectivity of connected graphs with fixed girth[J].Discrete Math,2008,308:5702-5711.
[13] ANDERSON W N,MORLEY T D.Eigenvalues of the Laplacian of a graph[J].Linear Multilinear Algebra,1985,18:141-145.
[14] KEL’MANS A K,CHELNOKOV V M.A certain polynomial of a graph and graphs with an extremal number of trees[J].J Combin Theory Ser B,1974,16:197-214.

备注/Memo

备注/Memo:
收稿日期:2018-05-17录用日期:2018-08-06
基金项目:新疆维吾尔自治区自然科学青年基金(2016D01C072)
Email:mxling2018@163.com
更新日期/Last Update: 1900-01-01