𝔖 Bobbio Scriptorium
✦   LIBER   ✦

DECOMPOSITIONS OF GENERALIZED COMPLETE GRAPHS

✍ Scribed by SMITH, BENJAMIN R.


Book ID
120222433
Publisher
Australian Mathematical Society
Year
2009
Tongue
English
Weight
59 KB
Volume
80
Category
Article
ISSN
0004-9727

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Cycle decompositions of complete graphs
✍ E.J. Farrell πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 447 KB

The circuit polynomial c%f the complete graph K, is used to deduce results about nodedisjoint -vcle decompositiorls of K,, satisfying variow restrictions.

Commuting decompositions of complete gra
✍ Saieed Akbari; Allen Herman πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 129 KB

## Abstract We say that two graphs __G__ and __H__ with the same vertex set commute if their adjacency matrices commute. In this article, we show that for any natural number __r__, the complete multigraph __K__ is decomposable into commuting perfect matchings if and only if __n__ is a 2‐power. Also