𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some properties of irreducible coverings by cliques of complete multipartite graphs

✍ Scribed by Ioan Tomescu

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
923 KB
Volume
28
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the number of irreducible coverings b
On the number of irreducible coverings by edges of complete bipartite graphs
✍ Ioan Tomescu πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 102 KB

In this paper it is proved that the exponential generating function of the numbers, denoted by N(p, q), of irreducible coverings by edges of the vertices of complete bipartite graphs Kp.q equals exp(xe r + ye x -x -y -xy) -t.

On minimum sets of 1-factors covering a
On minimum sets of 1-factors covering a complete multipartite graph
✍ David Cariolaro; Hung-Lin Fu πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 132 KB πŸ‘ 1 views

## Abstract We determine necessary and sufficient conditions for a complete multipartite graph to admit a set of 1‐factors whose union is the whole graph and, when these conditions are satisfied, we determine the minimum size of such a set. Β© 2008 Wiley Periodicals, Inc. J Graph Theory 58:239‐250,

General properties of some families of g
General properties of some families of graphs defined by systems of equations
✍ Felix Lazebnik; Andrew J. Woldar πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 200 KB

## Abstract In this paper we present a simple method for constructing infinite families of graphs defined by a class of systems of equations over commutative rings. We show that the graphs in all such families possess some general properties including regularity and biregularity, existence of speci