一类特殊theta-图的拉普拉斯谱刻画Laplacian spectral characterization of a class of special $theta$-graphs

be determined by its Laplacian spectrum

Keywords： Spectrum of a graph;Cospectral graphs;Eigenvalues;theta-graph 下载PDF阅读器 PDF全文下载： 初稿 （ 125 ） 作者简介： 通信联系人： 【收录情况】 中国科技论文在线： 夏海涛

 一类特殊theta-图的拉普拉斯谱刻画[EB/OL]

北京：中国科技论文在线

$P_{c+1}$是三条点不交的路,其中$c>=b>=a>=1$且三者中至多一个是1

分别粘合三条路的起点和终点所得到的图称为$theta$-图,记作$theta(a, b,c)$

本文将证明图$theta(m, m, m)(m>=2)$是由它的拉普拉斯谱确定的,并且将证明由图$theta(m,m,m)$在其一个三度点u上连接一个孤立点v所得到的新图(记作$theta^{prime}(m,m,m)$)也是由其拉普拉斯谱确定的

关键词： 图的谱

） 摘要： 称图$G$是由其拉普拉斯谱确定的,如果没有非同构的图具有相同的拉普拉斯谱

设$P_{a+1}$,$P_{b+1}$和

） Abstract： A graph $G$ is said to be determined by its Laplacian spectrum if there is no other non-isomorphic graph with the same Laplacian spectrum

Let $P_{a+1}$, $P_{b+1}$ and $P_{c+1}$ are three vertex-disjoint paths, where $c>=b>=a>=1$ and at most one of them can be

共谱图,特征值

$theta(m, m, m)$($m>=2$) is determined by its Laplacian spectrum

A kind of new graphs obtained by joining an isolated vertex $v$ to one of the

$theta(a, b, c)$, is called a $theta$-graph

In this paper, we will show that the graph

theta-图 Xia Haitao * （ Department of Mathematics and Statistics in Lanzhou University