منابع مشابه
Generating r-regular graphs
For each nonnegative integer r we determine a set of graph operations such that all r regular loopless graphs can be generated from the smallest r regular loopless graphs by using these operations We also discuss possible extensions of this result to r regular graphs of girth at least g for each xed g
متن کاملGenerating 5-regular planar graphs
For k = 0, 1, 2, 3, 4, 5, let Pk be the class of k-edge-connected 5regular planar graphs. In this paper, graph operations are introduced that generate all graphs in each Pk. ∗Research partially supported by NSF grants DMS-0556091 and ITR-0326387. †Research partially supported by Board of Regents grant LEQSF(2004-07)-RD-A-22.
متن کاملGenerating Random Regular Graphs Quickly
There are various algorithms known for generating graphs with n vertices of given degrees uniformly at random. Unfortunately, none of them is of practical use for all degree sequences, even for those with all degrees equal. In this paper we examine an algorithm which, although it does not generate uniformly at random, is provably close to a uniform generator when the degrees are relatively smal...
متن کاملGenerating 4-regular Hamiltonian Plane Graphs
This paper describes the study of a special class of 4-regular plane graphs which are Hamiltonian. These graphs are of special interest in knot theory. An algorithm is presented that randomly generates such graphs with n vertices with a fixed (and oriented) Hamiltonian cycle in O(n) time. An exact count of the number of such graphs with n vertices is obtained and the asymptotic growth rate of t...
متن کاملMost Regular Graphs Are Quickly R-transitive
Consider a d-regular directed graph, G, on n vertices determined by d permutations 1; : : : ; d 2 Sn. Each word, w, over the alphabet = f 1; 2; : : : ; dg determines a walk at each vertex, and these walks give rise to a permutation of the vertices (which is simply the product of the permutations). Such a word maps a distinct r-tuple of vertices, (v1; : : : ; vr) to another distinct r-tuple of v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00593-0