𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Spectrum of a Complete Multipartite Graph

✍ Scribed by Esser, Friedrich; Harary, Frank

Book ID
123217578
Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
522 KB
Volume
1
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On graphs with complete multipartite -gr
On graphs with complete multipartite -graphs
✍ Aleksandar JuriΕ‘iΔ‡; Akihiro Munemasa; Yuki Tagami πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 324 KB
On the euclidean dimension of a complete
On the euclidean dimension of a complete multipartite graph
✍ Hiroshi Maehara πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 272 KB

The euclidean dimension of a graph G, e(G), is the minimum n such that the vertices of G can be placed in euclidean n-space, R", in such a way that adjacent vertices have distance 1 and nonadjacent vertices have distances other than 1. Let G = K(n,, . , ns+,+J be a complete (s + t + u)-partite graph

On path factorizations of complete multi
On path factorizations of complete multipartite graphs
✍ Min-li Yu πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 523 KB

## Necessary conditions for IK(n, r), the complete multipartite graph with r parts of size n in which each edge has multiplicity 1, to have a P,-factorization are nr=O(mod k) and i(r-l)kn=O(mod2(k-1)). We show that when n=O(modk) or r=O(modk), these two conditions are also sufficient. (This impli