Excessive near 1-factorizations
نویسندگان
چکیده
We begin the study of sets of near 1-factors of graphs G of odd order whose union contains all the edges of G and determine, for a few classes of graphs, the minimum number of near 1-factors in such sets. MSC 2000: Primary 05C70; Secondary 05C15.
منابع مشابه
Partitionable graphs arising from near-factorizations of finite groups
In 1979, two constructions for making partitionable graphs were introduced in (by Chv2 atal et al. (Ann. Discrete Math. 21 (1984) 197)). The graphs produced by the second construction are called CGPW graphs. A near-factorization (A; B) of a %nite group is roughly speaking a non-trivial factorization of G minus one element into two subsets A and B. Every CGPW graph with n vertices turns out to b...
متن کاملCovering graphs with matchings of fixed size
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has size exactly m? If this happens, we say that G is [m]-coverable and we call M an [m]-covering of G. It is interesting (and probably of some practical value) to consider minimum [m]-coverings, i.e. [m]-coverings containing...
متن کاملExcessive factorizations of bipartite multigraphs
Let G be a multigraph. We say that G is 1-extendable if every edge of G is contained in a 1-factor. Suppose G is 1-extendable. An excessive factorization of G is a set F = {F1, F2, . . . , Fr} of 1-factors of G whose union is E(G) and, subject to this condition, r is minimum. The integer r is called the excessive index of G and denoted by χ′e(G). Analogously, let m be a positive integer. We say...
متن کاملRiordan group approaches in matrix factorizations
In this paper, we consider an arbitrary binary polynomial sequence {A_n} and then give a lower triangular matrix representation of this sequence. As main result, we obtain a factorization of the innite generalized Pascal matrix in terms of this new matrix, using a Riordan group approach. Further some interesting results and applications are derived.
متن کاملOn transitive one-factorizations of arc-transitive graphs
An equivalent relation between transitive 1-factorizations of arctransitive graphs and factorizations of their automorphism groups is established. This relation provides a method for constructing and characterizing transitive 1-factorizations for certain classes of arc-transitive graphs. Then a characterization is given of 2-arc-transitive graphs which have transitive 1factorizations. In this c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009