Closed trail decompositions of some classes of regular graphs

نویسندگان
چکیده

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

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

منابع مشابه

Cp-decompositions of some regular graphs

In this paper, for any prime p 11, we consider Cp-decompositions of Km × Kn and Km ∗ Kn and also Cp-factorizations of Km × Kn, where × and ∗ denote the tensor product and wreath product of graphs, respectively, (Km ∗ Kn is isomorphic to the complete m-partite graph in which each partite set has exactly n vertices). It has been proved that for m, n 3, Cp-decomposes Km ×Kn if and only if (1) eith...

متن کامل

Some minor-closed classes of signed graphs

We define four minor-closed classes of signed graphs in terms of embeddability in the annulus, projective plane, torus, and Klein bottle. We give the full list of 20 excluded minors for the smallest class and make a conjecture about the largest class.

متن کامل

Common Weight Decompositions of Some Classes of Graphs

ABSTRACT: A difference labeling of a graph G is realized by assigning distinct integer values to its vertices and then associating with each edge the absolute difference of those values assigned to its end vertices. A decomposition of labeled graph into parts, each part containing the edge having a commonweight is called a common – weight decomposition. In this paper we investigate the existenc...

متن کامل

Asymptotic Properties of Some Minor-Closed Classes of Graphs

Let A be a minor-closed class of labelled graphs, and let Gn be a random graph sampled uniformly from the set of n-vertex graphs of A. When n is large, what is the probability that Gn is connected? How many components does it have? How large is its biggest component? Thanks to the work of McDiarmid and his collaborators, these questions are now solved when all excluded minors are 2-connected. U...

متن کامل

Counting Independent Sets in Some Classes of (almost) Regular Graphs

We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some cases, construct the corresponding bijections.

متن کامل

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


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

ژورنال

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

سال: 2012

ISSN: 0012-365X

DOI: 10.1016/j.disc.2011.12.015