双圈图按谱半径的排序

一个n阶简单连通图G被称为双圈图,如果它的边数是n+1.记B(n)是n阶双圈图的全体.本文确定了B(n)(n≥20)中谱半径的第六大至第十大值和对应的图.     

关于双圈图的谱半径

如果G是连通的并且G的边数是n 1,那么n阶图G叫做双圈图,设B(n)是所有的阶为n的双圈图构成的集合,本文给出了B(n)(n(?)9)中前三大的邻接谱半径以及它们对应的图.     

两类双圈图的Laplacian谱确定问题

设G=(V(G),E(G))是一个简单连通图,V(G),E(G)分别表示图G的顶点集和边集.如果与图G同Laplacian谱的图都与G同构,则称图G由它的Laplacian谱确定.该文定义了两类双圈图Q(n;n_1,n_2,···,nt)和B(n;n_1,n_2),证明了双圈图Q(n;n_1),Q(n;n_1,n_2),Q(n;n_1,n_2,n_3)和双圈图B(n;n_1,n_2)分别由它们的Laplacian谱确定.     

双圈图的Laplacian Spread(英文)

Laplacian spread的概念在刻画图的整体性质方面非常重要.近年来,Fan等分别刻画了树中具有极大和极小Laplacian spread的图.另外Bao等确定了在所有单圈图中具有极大Laplacian spread的图.边数减去顶点数目为1的连通图称为双圈图.令B_n是所有有n个顶点构成的双圈图集合.对n≥11,本文确定了B_n中所有具有极大Laplacian spread的那些图.     

最大化小维数图的补的谱半径的统一方法

在树、单圈图、双圈图和三圈图的补图中,本文给出了统一的方法来刻画具有极大谱半径的图.     

双圈图的Laplace矩阵的谱半径

利用奇异点对的分类,得到了n阶双圈图的Laplace矩阵的谱半径的第二至第八大值,并且刻划了达到这些上界的极图.     

几类多圈图的拉普拉斯谱刻画

设图G是一个简单连通图. 如果任何一个与图G同拉普拉斯谱的图都与图G同构,则称图G是由其拉普拉斯谱确定的. 定义了双圈图\theta_{n}(p_1,p_2,\cdots,p_t) 和m 圈图H_n(m\cdot C_3;p_1,p_2,\cdots,p_t). 证明了双圈图\theta_{n}(p)和\theta_{n}(p,q),三圈图H_n(3\cdot C_3;p)和H_n(3\cdot C_3;p,q)分别是由它们的拉普拉斯谱确定的.     

关于单圈图与无交双圈图的邻接矩阵的行列式

研究图的邻接矩阵的行列式主要是为了研究图的零特征值的重数，而零特征值的重数在化学分子结构图的稳定性问题中有广泛的应用．本文给出了单圈图及无交双圈图的邻接矩阵的行列式分类．     

通往图的双圈覆盖猜想的新途径

本文提出了一些新的方法以接近图的用圈二重覆盖边的猜想,通称图的双圈覆盖猜想。因２０余年尚未解决而在图论中著名。从中,也提出了一些新的猜想。并论述了它们之间,以及它们与图的驿圈盖猜想之间的关系。     

关于K圈标号图的计数

本文研究含K个圈的标号图的计数问题,得出了有n个标定顶点且有K个交于一点的圈的连通图的计数公式,并得到了双圈连通标号图的计数公式,从而解决了K-2时连通图的计数问题。     

几族3-优图

一个图 G中含有的三个结点的导出连通子图的个数 S3( G)在网络可靠性中起着重要作用 .在同点数同边数图类中具有最大 S3( G)的图称为 3-优图 ,它所代表的网络是点故障概率接近 1时的最可靠网络 .本文在已有的结果上进一步证明补图为 a K3∪ b K2 ∪ K1和 a K3-x的图分别是各自图类中唯一的 3-优图 ;补图为 a K3∪ ( b-1 ) K2 ∪ 2 K1和 ( a-1 ) K3∪ b K2 ∪ P3的图是该图类中仅有的两个 3-优图 .     

点可迁图的限制边连通性

3限制边割是连通图的一个边割, 它将此图分离成阶不小于3的连通分支. 图G的最小3限制边割所含的边数称为此图的3限制边连通度, 记作λ\-3(G). 它以图G的3阶连通点导出 子图的余边界的最小基数ξ_3(G)为上界. 如果λ_3(G)=ξ_3(G), 则称图G是极大3限制边连通的 . 已知在某种程度上,3限制边连通度较大的网络有较好的可靠性. 作者在文中证明: 如果k正则连通点可迁图的 围长至少是5, 那么它是是极大3限制边连通的.     

Two Hamiltonian cycles

If the line graph of a graph G decomposes into Hamiltonian cycles, what is G? We answer this question for decomposition into two cycles.     

Circulant Double Coverings of a Circulant Graph of Valency Four

Several isomorphism classes of graph coverings of a graph G have been enumerated by many authors (see [3], [8]–[15]). A covering of G is called circulant if its covering graph is circulant. Recently, the authors [4] enumerated the isomorphism classes of circulant double coverings of a certain kind, called typical, and showed that no double covering of a circulant graph of valency 3 is circulant. In this paper, the isomorphism classes of connected circulant double coverings of a circulant graph of valency 4 are enumerated. As a consequence, it is shown that no double covering of a non-circulant graph G of valency 4 can be circulant if G is vertex-transitive or G has a prime power of vertices. The first author is supported by NSF of China (No. 60473019) and by NKBRPC (2004CB318000), and the second author is supported by Com²MaC-KOSEF (R11-1999-054) in Korea.     

Circulant Double Coverings of a Circulant Graph of Valency Five

Enumerating the isomorphism classes of several types of graph covering projections is one of the central research topics in enumerative topological graph theory. A covering of G is called circulant if its covering graph is circulant. Recently, the authors [Discrete Math., 277, 73-85 （2004）1 enumerated the isomorphism classes of circulant double coverings of a certain type, called a typical covering, and showed that no double covering of a circulant graph of valency three is circulant. Also, in [Graphs and Combinatorics, 21,386 400 （2005）], the isomorphism classes of circulant double coverings of a circulant graph of valency four are enumerated. In this paper, the isomorphism classes of circulant double coverings of a circulant graph of valency five are enumerated.     

Hamilton非二部图的弱泛圈性

图G称为弱泛圈图是指G包含了每个长为t(g(V)≤l≤c(G))的圈,其中g(G),c(v)分别是G的围长与周长.1997年Brandt提出以下猜想:边数大于[n2/4]-n 5的n阶非二部图为弱泛圈图.1999年Bollobas和Thomason证明了边数不小于[n2/4]-n 59的n阶非二部图为弱泛圈图.作者证明了如下结论:设G是n阶Hamilton非二部图,若G的边数不小于[n2/4]-n 12,则G为弱泛圈图.     

双圈覆盖问题

Seyntour[1]与Szekeres[5]猜想，每一个无割边的图G具有一个圈集合 使G中的每个边存在于 的两个圈中。本证明此猜想成立当且仅当它对没有非平凡的三个边割的图成立。     

Large cycles in random generalized Johnson graphs

This paper studies thresholds in random generalized Johnson graphs for containing large cycles, i.e. cycles of variable length growing with the size of the graph. Thresholds are obtained for different growth rates.     

Petersen图的Hamilton性和边色数

对简单图G(V,E),定义图G的关联图I(G)为V(I(G))={(ve)|v∈V(G)且e∈E(G)和v与e关联},E(I(G))={(ue,vf)Iu=v或e=f或uv=e或uv=f}.本文证明了Petersen图可被分解为边不交的Hamilton-圈和一个1-因子的并.     

On even cycle decompositions of line graphs of cubic graphs

An even cycle decomposition of a graph is a partition of its edges into cycles of even length. In 2012, Markström conjectured that the line graph of every 2-connected cubic graph has an even cycle decomposition and proved this conjecture for cubic graphs with oddness at most 2. However, for 2-connected cubic graphs with oddness 2, Markström only considered these graphs with a chordless 2-factor. (A chordless 2-factor of a graph is a 2-factor consisting of only induced cycles.) In this paper, we first construct an infinite family of 2-connected cubic graphs with oddness 2 and without chordless 2-factors. We then give a complete proof of Markström’s result and further prove this conjecture for cubic graphs with oddness 4.