Decompositions of Graphs into Fans and Single Edges

Given two graphs G and H , an H‐decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a graph isomorphic to H . Let be the smallest number ? such that any graph G of order n admits an H‐decomposition with at most ? parts. Pikhurko and Sousa conjectured that for and all sufficiently large n , where denotes the maximum number of edges in a graph on n vertices not containing H as a subgraph. Their conjecture has been verified by Özkahya and Person for all edge‐critical graphs H . In this article, the conjecture is verified for the k‐fan graph. The k‐fan graph , denoted by , is the graph on vertices consisting of k triangles that intersect in exactly one common vertex called the center of the k‐fan.     

Induced Decompositions of Graphs

We consider those graphs G that admit decompositions into copies of a fixed graph F, each copy being an induced subgraph of G. We are interested in finding the extremal graphs with this property, that is, those graphs G on n vertices with the maximum possible number of edges. We discuss the cases where F is a complete equipartite graph, a cycle, a star, or a graph on at most four vertices.     

On Connected Resolving Decompositions in Graphs

For an ordered k-decomposition of a connected graph G and an edge e of G, the -code of e is the k-tuple where d(e, G _i) is the distance from e to G _i. A decomposition is resolving if every two distinct edges of G have distinct -codes. The minimum k for which G has a resolving k-decomposition is its decomposition dimension dim _d (G). A resolving decomposition of G is connected if each G _i is connected for 1 i k. The minimum k for which G has a connected resolving k-decomposition is its connected decomposition number cd(G). Thus 2 dim _d (G) cd(G) m for every connected graph G of size m 2. All nontrivial connected graphs of size m with connected decomposition number 2 or m have been characterized. We present characterizations for connected graphs of size m with connected decomposition number m – 1 or m – 2. It is shown that each pair s, t of rational numbers with 0 < s t 1, there is a connected graph G of size m such that dim _d (G)/m = s and cd(G)/m = t.     

On Cyclic Decompositions of Complete Graphs into Tripartite Graphs

We introduce two new labelings for tripartite graphs and show that if a graph G with n edges admits either of these labelings, then there exists a cyclic G‐decomposition of for every positive integer x. We also show that if G is the union of two vertext‐disjoint cycles of odd length, other than , then G admits one of these labelings.     

Monochromatic Kr‐Decompositions of Graphs

Given graphs G and H, and a coloring of the edges of G with k colors, a monochromatic H‐decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a monochromatic graph isomorphic to H. Let be the smallest number ? such that any graph G of order n and any coloring of its edges with k colors, admits a monochromatic H‐decomposition with at most ? parts. Here, we study the function for and .     

图的连通因子

连通因子问题与Hamilton问题和信息网络有着密切的联系．1993年，首先由M.Kano就该问题在[6]中提出了许多问题和猜想，接下来他又在[16]中提出了一些猜想，本文就连通因子问题在过去十年的主要进展进行了回顾并提出了若干可进一步研究的问题和猜想．     

On Large Lattice Packings of Spheres

The packing density of large lattice packings of spheres in Euclidean E ^d measured by the parametric density depends on the parameter and on the shape of the convex hull P of the sphere centers; in particular on the isoperimetric coefficient of P and on the second term in the Ehrhart polynomial of the lattice polytope P. We show in E ^d , d 2, that flat or spherelike polytopes generate less dense packings, whereas polytopes with suitably chosen large facets generate dense packings. This indicates that large lattice packings in E ³ of high parametric density may be good models for real crystals.     

On Orthogonal Double Covers of Graphs

A transformation which allows us to obtain an orthogonal double cover of a graph G from any permutation of the edge set of G is described. This transformation is used together with existence results for self-orthogonal latin squares, to give a simple proof of a conjecture of Chung and West.     

关于(g,f)-2-消去图

一个图G称为一个(g,f)-2-消去图,如果G的任何两条边不属于它的一个(g,f)-因子.本文给出了当g＜f时一个图是(g,f)-2-消去图的一个充要条件.     

Decomposition of Complete Graphs into Isomorphic Complete Bipartite Graphs

A decomposition of a complete graph into disjoint copies of a complete bipartite graph is called a ‐design of order n. The existence problem of ‐designs has been completely solved for the graphs for , for , K_{2, 3} and K_{3, 3}. In this paper, I prove that for all , if there exists a ‐design of order N, then there exists a ‐design of order n for all (mod ) and . Giving necessary direct constructions, I provide an almost complete solution for the existence problem for complete bipartite graphs with fewer than 18 edges, leaving five orders in total unsolved.     

图的符号星控制数与因子

利用图的因子研究图的符号星控制数,简化了文献中已有的结果.     

2-连通无爪图的连通因子

若图G不含有同构于K1,3的导出子图,则称G为一个无爪图.令a和b是两个整数满足2≤a≤b.本文证明了若G是一个含有[a,b]因子的2连通无爪图,则G有一个连通的[a,b 1]因子.     

$K_v$的最大$K_2K_3$填充设计

Abstract Let Kv be the complete graph on v vertices, and G a finite simple undirected graph without isolated vertices. A G-packing of Kv, denoted by （v, G, 1）-packing, is a pair （X,A） where X is the vertex set of K＋ and ＋4 is a family of edge-disjoint subgraphs isomorphic to G in Kv. In this paper, the maximum number of subgraphs in a （v, G, 1）-packing is determined when G is K2 x K3, the Cartesian product of K2 and K3, leaving two orders undetermined. This design originated from the use of DNA library screening.     

On Orthogonal Double Covers of Graphs

An orthogonal double cover (ODC) is a collection of n spanning subgraphs(pages) of the complete graph K _n such that they cover every edge of the completegraph twice and the intersection of any two of them contains exactly one edge. If all the pages are isomorphic tosome graph G, we speak of an ODC by G. ODCs have been studied for almost 25 years, and existenceresults have been derived for many graph classes. We present an overview of the current state of research alongwith some new results and generalizations. As will be obvious, progress made in the last 10 years is in many waysrelated to the work of Ron Mullin. So it is natural and with pleasure that we dedicate this article to Ron, on theoccasion of his 65th birthday.     

Packings of the complete directed graph with m-circuits

A packing of the complete directed symmetric graph DKv with m-circuits, denoted by(v,m)-DCP, is defined to he a family of are-disjoint m-circuits of DK, such that any one arc of DKv occurs in at most one m circuit. The packing number P(v,m) is the maximum number of m-circults in such a packing. The packing problem is to determine the value P(v,m) for everyinteger v ≥ m. In this paper, the problem is reduced to the case m 6 ≤v≤2m-[(4m-3的平方极) 1/2],for any fixed even integer m≥4,In particular,the values of P（v,m） are completely determined for m=12,14 and 16.     

图的（g，f）－因子和因子分解

设Ｇ是一个图，ｇ，ｆ是定义在图Ｇ的顶点集上的两个整数值函数且图Ｇ的一个（ｇ，ｆ）－因子是Ｇ的一个支撑子图Ｆ使对任意的ｘ∈Ｖ（Ｆ）有本文给出了一个图（ｇ，ｆ）－可因子化的若干充分条件和一个图是（ｇ，ｆ）－消去图的充分必要条件，并研究了这些条件的应用。     

关于Abel群上Cayley图的Hamilton圈分解

设Ｇ（Ｆ，Ｔ∩Ｔ＾－１）是有限Ａｂｅｌ群Ｆ上的Ｃａｙｌｅｙ图，Ｔ∩Ｔ＾－１只含２阶元，此文证明了当Ｔ是Ｆ的极小生成元集时，若ｄ（Ｇ）＝２ｋ，则Ｇ是ｋ个边不相交的Ｈａｍｉｌｔｏｎ圈的并，若ｄ（Ｇ）＝２ｋ＋１，则Ｇ是ｋ个边不相交的Ｈａｍｉｌｔｏｎ圈与一个１－因子的并。     

图的（g，f）－因子和因子分解

设Ｇ是一个图，ｇ，ｆ是定义在图Ｇ的顶点集上的两个整数值函数且图Ｇ的一个（ｇ，ｆ）－因子是Ｇ的一个支撑子图Ｆ使对任意的ｘ∈Ｖ（Ｆ）有本文给出了一个图（ｇ，ｆ）－可因子化的若干充分条件和一个图是（ｇ，ｆ）－消去图的充分必要条件，并研究了这些条件的应用。