消去图、覆盖图和均匀图的若干结果

设 G是一个图 ,g,f是定义在图 G的顶点集上的两个整数值函数 ,且g≤f.图 G的一个 ( g,f) -因子是 G的一个支撑子图 F,使对任意的 x∈V( F)有g( x)≤ d F( x)≤ f ( x) .文中推广了 ( g,f) -消去图、( g,f ) -覆盖图和 ( g,f) -均匀图的概念 ,给出了在 g相似文献   

书本图Bm的协调和相继标号

本文给出了书本图Ｂ２ｍ的ｍ种不同的相继标号和Ｂ４ｍ＋１的ｍ种不同的相继标号。因而，书本图Ｂｍ是相继图的充分条件为：ｍ＞１且ｍ≠（３ｍｏｄ４）。这一条件也是书本图Ｂｍ是协调图的充要条件。     

二面体群D_(2n)的4度正规Cayley图

设G是有限群,S是G的不包含单位元1的非空子集．定义群G关于S的 Cayley(有向)图X=Cay(G,S)如下:V(x)=G,E(X)={(g,sg)|g∈G,s∈S}． Cayley图X=Cay(G,S)称为正规的如果R(G)在它的全自同构群中正规．图X称为1-正则的如果它的全自同构群在它的弧集上正则作用．本文对二面体群D2n以Z22 为点稳定子的4度正规Cayley图进行了分类．     

（mg＋m—1,mf—m＋1）—图的（g,f）—因子

本文证明了（ｍｇ＋ｍ－１,ｍｆ－ｍ＋１）－图具有一些特殊的（ｇ,ｆ）－因子,从而推广到了关于（ｇ,ｆ）－覆盖图和（ｇ,ｆ）－消去图的有关结果,有助于进一步研究（ｍｇ＋ｍ－１,ｍｆ－ｍ＋１）－图的正交因子分解问题。     

4p阶三度点传递图

一个图称为点传递图或对称图如果它的自同构群分别在点集或点集有序对上传递.设P为素数,给出了4p阶连通三度点传递图分类(徐明曜等在[Chin.Ann.Math.,2004,25B(4):545-554]中分类了4p阶连通三度对称图).确定了4p阶互不同构的连通三度点传递图的个数f(4p);当P=2,3,5,7时,f(4p)分别为2,4,8,6;当P≥11且4|(p-1)时,f(4p)=5+p-3/2,当P≥11且4|(p-1)时,f(4p)=3+p-3/2.     

两类满足A（H）=3的图

本文利用文[3]的方法给出了两类满足A(H)=3的图,从而肯定了满足A(H)=3的图是不唯一的。本文还给出了满足A(H)=3的最小图。     

Hamilton图的特定生成了图问题的反例

［１］定理３断言：一个Ｈａｍｉｌｔｏｎ图Ｇ必存在仅有ｐ条桥的相间偶圈，如果相间偶圈的边中有边在Ｇ的ｐ个不连通初等子圈上（ｐ≥２）。本的反例表明上述结论是错的，从而［１］中关于Ｐｅｔｅｒｓｏｎ图不是Ｈａｍｉｌｔｏｎ图的证明也不成立。     

(g,f)-消去图的若干充分条件

设 G是一个图 ,用 V(G)和 E(G)表示它的顶点集和边集 ,并设 g和 f是定义在 V(G)上的两个整数值函数且 g 相似文献   

（a,b,k）—临界图

设Ｇ是一个图且设ａ，ｂ是非负整数，ａ〈ｂ。如果消去Ｇ的任意ｋ个顶点剩下的图有〔ａ，ｂ〕因子，则称图Ｇ是（ａ，ｂ，ｋ）－临界图。本文给出了一个图是（ａ，ｂ，ｋ）－临界图的一个充分必要条件。讨论了该条件的一些应用，研究了（ａ，ｂ，ｋ）－临界图的性质。     

连通的顶点可迁图的色唯一性

本文给出从一个已知的顶点可迁的非色唯一图出发,构造无穷多个顶点可迁的非色唯一图的一种方法,据此给出若干类无穷多个连通的顶点可迁,但不是色唯一的图簇,从而进一步否定地回答了Chia在[1]中提出的问题.     

几类强协调图与非强协调图

证明了风车图K4n3(n∈自然数)及其它几类强协调图,并给出了统一的强协调值标号,最后证明了Kn-e(n≥6)是非强协调图.     

强正则自补图的一个注记

Kotzig put forward a question on strongly-regular self-complementary graphs, that is, for any natural number k, whether there exists a strongly-regular self- complementary graph whose order is 4k 1, where 4k 1=x2 y2, x and y are positive integers; what is the minimum number that made there exist at least two non-isomorphic strongly-regular self-complementary graphs. In this paper, we use two famous lemmas to generalize the existential conditions for strongly-regular self-complementary circular graphs with 4k 1 orders.     

A Generalization of Strongly Regular Graphs

Motivated from an example of ridge graphs relating to metric polytopes, a class of connected regular graphs such that the squares of their adjacency matrices are in certain symmetric Bose-Mesner algebras of dimension 3 is considered in this paper as a generalization of strongly regular graphs. In addition to analysis of this prototype example defined over (MetP₅)^*, some general properties of these graphs are studied from the combinatorial view point.AMS Subject Classification: 05E30.     

Non Existence of Triangle Free Quasi-symmetric Designs

The following two results are proved. Let D be a triangle free quasi-symmetric design with k=2y−x and x≥ 1 then D is a trivial design with v=5 and k=3. There do no exist triangle free quasi-symmetric designs with x≥ 1 and λ=y or λ=y−1.Communicated by: P. Wild     

Quasi‐symmetric designs with fixed difference of block intersection numbers

The following results for proper quasi‐symmetric designs with non‐zero intersection numbers x,y and λ > 1 are proved.

• (1) Let D be a quasi‐symmetric design with z = y ? x and v ≥ 2k. If x ≥ 1 + z + z³ then λ < x + 1 + z + z³.
• (2) Let D be a quasi‐symmetric design with intersection numbers x, y and y ? x = 1. Then D is a design with parameters v = (1 + m) (2 + m)/2, b = (2 + m) (3 + m)/2, r = m + 3, k = m + 1, λ = 2, x = 1, y = 2 and m = 2,3,… or complement of one of these design or D is a design with parameters v = 5, b = 10, r = 6, k = 3, λ = 3, and x = 1, y = 2.
• (3) Let D be a triangle free quasi‐symmetric design with z = y ? x and v ≥ 2k, then x ≤ z + z².
• (4) For fixed z ≥ 1 there exist finitely many triangle free quasi‐symmetric designs non‐zero intersection numbers x, y = x + z.
• (5) There do not exist triangle free quasi‐symmetric designs with non‐zero intersection numbers x, y = x + 2.

© 2006 Wiley Periodicals, Inc. J Combin Designs 15: 49–60, 2007     

Asymptotic enumeration of strongly connected digraphs by vertices and edges

We derive an asymptotic formula for the number of strongly connected digraphs with n vertices and m arcs (directed edges), valid for m ‐ n →∞ as n →∞ provided m = O(nlog n). This fills the gap between Wright's results which apply to m = n + O (1) , and the long‐known threshold for m, above which a random digraph with n vertices and m arcs is likely to be strongly connected. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013     

A note on Ramsey numbers for books

The book with n pages B_n is the graph consisting of n triangles sharing an edge. The book Ramsey number r(B_m,B_n) is the smallest integer r such that either B_m ? G or B_n ? G for every graph G of order r. We prove that there exists a positive constant c such that r(B_m,B_n) = 2n + 3 for all n ≥ cm. Our proof is based mainly on counting; we also use a result of Andrásfai, Erd?s, and Sós stating that triangle‐free graphs of order n and minimum degree greater than 2n/5 are bipartite. © 2005 Wiley Periodicals, Inc. J Graph Theory     

几类有趣图的奇优美性和奇强协调性

对于简单图G=〈V,E〉,如果存在一个映射f:V(G)→{0,1,2,…,2|E|-1}满足:1)对任意的u,v∈V,若u≠v,则f(u)≠f(v);2)max{f(v)|v∈V}=2|E|-1;3)对任意的e_1,e_2∈E,若e_1≠e_2,则g(e_1)≠g(e_2),此处g(e)=|f(u)+f(v)|,e=uv;4)|g(e)|e∈E}={1,3,5,…,2|E|-1},则称G为奇优美图,f称为G的奇优美标号.设G=〈V,E〉是一个无向简单图.如果存在一个映射f:V(G)→{0,1,2,…,2|E|-1},满足:1)f是单射;2)■uv∈E(G),令f(uv)=f(u)+f(v),有{f(uv)|uv∈E(G)}={1,3,5,…,2|E|-1},则称G是奇强协调图,f称为G的.奇强协调标号或奇强协调值.给出了链图、升降梯等几类有趣图的奇优美标号和奇强协调标号.     

积图P_n×P_m的奇优美性和奇强协调性

给出了积图P_n×P_m的奇优美标号和奇强协调标号.     

There is no (95, 40, 12, 20) strongly regular graph

We show that there is no (95, 40, 12, 20) strongly regular graph and, consequently, there is no (96, 45, 24, 18) strongly regular graph, no nontrivial regular two‐graph on 96 vertices, and no partial geometry pg(4, 9, 2). The main idea of the result is based on the star complement technique and requires a moderate amount of computation.