Laplacian spectral characterization of dumbbell graphs and theta graphs | |
Liu, Xiaogang1,3; Lu, Pengli2 | |
刊名 | DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS
![]() |
2016-06-01 | |
卷号 | 8期号:2 |
关键词 | Dumbbell graph Theta graph L-spectrum L-cospectral graph L-DS graph |
ISSN号 | 1793-8309 |
DOI | 10.1142/S1793830916500282 |
英文摘要 | 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. |
WOS研究方向 | Mathematics |
语种 | 英语 |
出版者 | WORLD SCIENTIFIC PUBL CO PTE LTD |
WOS记录号 | WOS:000377678500011 |
内容类型 | 期刊论文 |
源URL | [http://ir.lut.edu.cn/handle/2XXMBERH/155689] ![]() |
专题 | 机电工程学院 |
作者单位 | 1.Univ Melbourne, Dept Math & Stat, Parkville, Vic 3010, Australia; 2.Lanzhou Univ Technol, Sch Comp & Commun, Lanzhou 730050, Gansu, Peoples R China 3.Northwestern Polytech Univ, Dept Appl Math, Xian 710072, Shaanxi, 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). |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论