优美图的一些性质

对于一个(p,q)-图G,如果存在一个单射.f:V(G)→{0,1,…,q},使得边标号集合{f(uv)| uv∈E(G)}={1,2,…,q},其中边标号为f(uv)=|f(u)-f(v)|,那么称G是优美图,并称.f是G的一个优美标号.通过研究若干优美图,得出一些优美图的性质.     

开关图的几个代数性质

首先对开关图的自同构群进行了研究,随即讨论了它的点传递性,并得到Calyley图的开关图依然是Cayley图.     

边覆盖临界图的一些性质

设G是一个简单图,其顶点集为V(G)而边集为E(G),S∈E(G)称为 G的一个覆盖,如果由S导出的子图为G的一个生成子图. G的边覆盖色数χ'c(G)是E(G,)所能划分成的最大边覆盖数.已知δ-1 ≤χ'c(G)≤δ,由此将χ'c(G)=δ的图称为CI类图,否则称为CII类图.若G是连通CII类图,且G不是完全图,对任意的u,u∈V(G),e=uv( )E(G),都有χ'c(G+e)＞χ'c(G)成立,则称G为边覆盖临界的.本文研究了边覆盖临界图的一些性质.即若G为边覆盖临界图,则对任意的u,v∈V(G),若e=uv( )E(G),总存在w∈{u,v},有d(w)≤2δ-2,且w至少与max{d(w)-δ+1,3d(w)-4δ+4}个最小度顶点相邻.     

强正则图的一些性质

文[3]给出了强正则图的概念及有关性质,本文在此基地上利用图的谱性质,得到了强正则图的又一些性质。     

几种复合图生成树个数的一般求法

若一个图能够由某一个或某几个运算作用于不相交的图上而得到，则称该图为复合图．记ｔ（Ｇ）为图Ｇ的生成树个数，Ｈ（Ｇ）为图Ｇ的Ｋｉｒｃｈｈｏｆｆ矩阵，用“ｏ”表示图的某种运算，如“＋”，“×”，“合成”等，本文研究了Ｈ（ＧｏＧ′）与Ｈ（Ｇ），Ｈ（Ｇ′）的特征值关系，给出了ｔ（ＧｏＧ′）的一般性公式，提供了几种复合图生成树个数的一般性公式，提供了几种复合图生成树个数的一般求法，大大推广了［２，３］的结果，同时简化了许多图类生成树个数表达式的求法．     

图的代数连通度的界(英文)

本文首先给出了简单图的度序列的平方和的上界,利用这些结果,求出了简单图的代数连通度的几个上下界并确定了它们的临界图。另外,文章也给出了加权图的代数连通度的一个下界。     

有向循环图的支撑树数

设k≥2,1≤a_1相似文献   

正规矩阵的若干性质

众所周知,Hermite矩阵有许多较好的性质,其中多数性质对一般矩阵是不成立的。然而,对一类常见的特殊矩阵—正规矩阵,却有着类似的性质。本文就来对此进行一些研究。     

上连通和超连通的三次Bi-Cayley图

Let G be a finite group and let S(possibly, contains the identity element) be a subset of G. The Bi-Cayley graph BC(G, S) is a bipartite graph with vertex set G×{0, 1} and edge set {(g, 0) (sg, 1) : g∈G, s ∈ S}. A graph is said to be super-connected if every minimum vertex cut isolates a vertex. A graph is said to be hyper-connected if every minimum vertex cut creates two components, one of which is an isolated vertex. In this paper, super-connected and/or hyper-connected cubic Bi-Cayley graphs are characterized.     

复对称算子的一些等价性质

证明了在复对称算子的前提下,对数-亚正规算子与正规算子是等价的,并且给出了复对称算子的一些等价性质;最后通过给出例子来说明我们的结论.     

代数图论中的几个新结论

本文中我们证明几个关于克希霍夫矩阵的新定理.在这些定理下,代数图论中Temperly,Kelmans,以及Fiedler提出的一些早期定理成为直接的推论.     

On the extendability of Bi-Cayley graphs of finite abelian groups

Let G be a finite group and A a nonempty subset (possibly containing the identity element) of G. The Bi-Cayley graph X=BC(G,A) of G with respect to A is defined as the bipartite graph with vertex set G×{0,1} and edge set {{(g,0),(sg,1)}∣g∈G,s∈A}. A graph Γ admitting a perfect matching is called n-extendable if ∣V(Γ)∣≥2n+2 and every matching of size n in Γ can be extended to a perfect matching of Γ. In this paper, the extendability of Bi-Cayley graphs of finite abelian groups is explored. In particular, 2-extendable and 3-extendable Bi-Cayley graphs of finite abelian groups are characterized.     

Algebraic Properties of Edge Ideals of Some Vertex-Weighted Oriented Cyclic Graphs

We provide some exact formulas for the projective dimension and regularity of edge ideals associated to some vertex-weighted oriented cyclic graphs with a common vertex or edge.These formulas are functions in the weight of the vertices,and the numbers of edges and cycles.Some examples show that these formulas are related to direction selection and the assumption that w(x)≥2 for any vertex x cannot be dropped.     

关于紧图和超紧图的几个结果

给出了一些 新的紧图,并对 不是超紧的紧图 作了一些讨论     

算术图的若干性质

本文得到了算术图的一些新性质，并解决了文[1]提出的两个猜想.     

Edge‐Disjoint Spanning Trees,Edge Connectivity,and Eigenvalues in Graphs

Let and denote the second largest eigenvalue and the maximum number of edge‐disjoint spanning trees of a graph G, respectively. Motivated by a question of Seymour on the relationship between eigenvalues of a graph G and bounds of , Cioab? and Wong conjectured that for any integers and a d‐regular graph G, if , then . They proved the conjecture for , and presented evidence for the cases when . Thus the conjecture remains open for . We propose a more general conjecture that for a graph G with minimum degree , if , then . In this article, we prove that for a graph G with minimum degree δ, each of the following holds.

• (i) For , if and , then .
• (ii) For , if and , then .

Our results sharpen theorems of Cioab? and Wong and give a partial solution to Cioab? and Wong's conjecture and Seymour's problem. We also prove that for a graph G with minimum degree , if , then the edge connectivity is at least k, which generalizes a former result of Cioab?. As corollaries, we investigate the Laplacian and signless Laplacian eigenvalue conditions on and edge connectivity.     

若干图的广义Mycielski图的边色数

设图G(V,E)为简单图,V(Mn(G))={v01,v02,…,v0p;v11,v12,…,v1p;…,vn1,vn2,…,vnp}EMn(G))=E(G)∪vijv(i+1)kv0 jv0k∈E(G),1 j,k p,i=0,1,…,n-1称Mn(G)为G的n串广义M ycielsk i图,其中n为自然数,V(G)={v01,v02,…,v0p}.本文得到了路、圈、扇、轮、星图的广义M ycielsk i图的边色数.