A necessary and sufficient condition for the star decomposition of complete graphs
β Scribed by Lin, Chiang; Shyu, Tay-Woei
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 130 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper w e prove the following result. Let ml 2 m2 2 ... 2 ml be nonnegative integers. A necessary and sufficient condition for the complete graph K,, to be decomposed into stars S,,, , S
π SIMILAR VOLUMES
## Abstract In this paper, necessary and sufficient conditions are derived for the existence of a common quadraβtic Lyapunov function for a finite number of stable second order linear timeβinvariant systems. Copyright Β© 2002 John Wiley & Sons, Ltd.
A graph is called K1,.-free if it contains no K l , n as an induced subgraph. Let n ( r 3), r be integers (if r is odd, r 2 n -1). We prove that every Kl,,-free connected graph G with rlV(G)I even has an r-factor if its minimum degree is at least This degree condition is sharp.