Laplacian spectral characterization of dumbbell graphs and theta graphs

doi:10.1142/S1793830916500282

IR > 机电工程学院

	Laplacian spectral characterization of dumbbell graphs and theta graphs
	Liu, Xiaogang1,2 ; Lu, Pengli 3
	2016-06-01
发表期刊	DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS
ISSN	1793-8309
卷号	8 期号:2
摘要	Let P-n and C-n denote the path and cycle on n vertices, respectively. The dumbbell graph, denoted by D-p,D- k,D- q, is the graph obtained from two cycles C-p, C-q and a path Pk+2 by identifying each pendant vertex of Pk+2 with a vertex of a cycle, respectively. The theta graph, denoted by Theta(r, s, t), is the graph formed by joining two given vertices via three disjoint paths P-r, P-s and P-t, respectively. In this paper, we prove that all dumbbell graphs as well as all theta graphs are determined by their L-spectra.
关键词	Dumbbell graph Theta graph L-spectrum L-cospectral graph L-DS graph
DOI	10.1142/S1793830916500282
收录类别	ESCI
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics, Applied
WOS记录号	WOS:000377678500011
出版者	WORLD SCIENTIFIC PUBL CO PTE LTD
引用统计	无
文献类型	期刊论文
条目标识符	https://ir.lut.edu.cn/handle/2XXMBERH/155689
专题	机电工程学院
通讯作者	Lu, Pengli
作者单位	1.Northwestern Polytech Univ, Dept Appl Math, Xian 710072, Shaanxi, Peoples R China; 2.Univ Melbourne, Dept Math & Stat, Parkville, Vic 3010, Australia; 3.Lanzhou Univ Technol, Sch Comp & Commun, Lanzhou 730050, Gansu, Peoples R China
第一作者单位	理学院
通讯作者单位	兰州理工大学
第一作者的第一单位	理学院
推荐引用方式 GB/T 7714	Liu, Xiaogang,Lu, Pengli. Laplacian spectral characterization of dumbbell graphs and theta graphs[J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS,2016,8(2).
APA	Liu, Xiaogang,&Lu, Pengli.(2016).Laplacian spectral characterization of dumbbell graphs and theta graphs.DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS,8(2).
MLA	Liu, Xiaogang,et al."Laplacian spectral characterization of dumbbell graphs and theta graphs".DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS 8.2(2016).