Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages
نویسندگان
چکیده
منابع مشابه
Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages
Let q be a prime power and g ∈ {6, 8, 12}. In this paper we obtain (q, g)-graphs on 2qg/2−3(q2 − 1) vertices for g = 6, 8, 12 as subgraphs of known (q + 1, g)-cages. We also obtain (q − r, 6)-graphs on 2(q2 − rq − 1) vertices, and (q − r, 8)-graphs on 2(q3−rq2−q+r) vertices where r is a positive integer such that q ≥ r+3. Furthermore, we find (q − 1, 12)-graphs of order 2q2(q3 − q2 − q + 1). So...
متن کاملSmall subgraphs of random regular graphs
The main aim of this short paper is to answer the following question. Given a fixed graph H , for which values of the degree d does a random d-regular graph on n vertices contain a copy of H with probability close to one?
متن کاملFinding Regular Subgraphs in Both Arbitrary and Planar Graphs
We show that the problems of deciding whether an arbitrary graph has a k-regular subgraph, for some given k 3; of deciding whether a planar graph has a quartic subgraph; and of deciding whether a planar graph has a quintic subgraph, are complete for NP via logspace reductions. There are no regular planar graphs of degree greater than 5.
متن کاملThree-regular Subgraphs of Four-regular Graphs'
The Berge–Sauer conjecture (see [2, 3]) says that any simple (no multiple edges and loops) 4-regular graph contains a 3-regular subgraph. This conjecture was proved in [4, 6]. In [1, 2] the Chevalley–Warning theorem was used to extend this result to graphs with multiple edges, which are 4-regular plus an edge. Our main result, Theorem 2.2, presents the sufficient condition for a 4-regular graph...
متن کاملRegular subgraphs of almost regular graphs
Suppose every vertex of a graph G has degree k or k + 1 and at least one vertex has degree k + 1. It is shown that if k > 2q 2 and q is a prime power then G contains a q-regular subgraph (and hence an r-regular subgraph for all r < q. r = q (mod 2)). It is also proved that every simple graph with maximal degree A > 2q 2 and average degree d > ((2q 2)/(2q l))(A + 1), where q is a prime power, co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2010
ISSN: 0012-365X
DOI: 10.1016/j.disc.2009.12.014