Isomorphic factorization of r-regular graphs into r parts

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Isomorphic Factorization of Regular Graphs and 3-regular Multigraphs

A multigraph G is divisible by t if its edge set can be partitioned into / subsets, such that the subgraphs (called factors) induced by the subsets are all isomorphic. If G has e(G) edges, then it is t-rational if it is divisible by t or if / does not divide e{G). A short proof is given that any graph G is /-rational for all t ^ x'(G) ( t n e chromatic index of G), and thus any r-regular graph ...

متن کامل

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

متن کامل

R-parts in hyperrings

In this article, first we generalize the concept of complete parts in hyperrings by introducing the concept R-parts in hyperrings and then we study R-closures in hyperrings. Finally we characterize R-closures in hyperfields.

متن کامل

Unmixed $r$-partite graphs

‎Unmixed bipartite graphs have been characterized by Ravindra and‎ ‎Villarreal independently‎. ‎Our aim in this paper is to‎ ‎characterize unmixed $r$-partite graphs under a certain condition‎, ‎which is a generalization of Villarreal's theorem on bipartite‎ ‎graphs‎. ‎Also, we give some examples and counterexamples in relevance to this subject‎.

متن کامل

Decomposition of cartesian products of regular graphs into isomorphic trees

We extend the ideas of Snevily and Avgustinovitch to enlarge the families of 2mregular graphs and m-regular bipartite graphs that are known to decompose into isomorphic copies of a tree T with m edges. For example, consider r1, . . . , rk with ∑k i=1 ri = m. If T has a k-edge-coloring with ri edges of color i such that every path in T uses some color once or twice, then every cartesian product ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1988

ISSN: 0012-365X

DOI: 10.1016/0012-365x(88)90174-4