𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complete Multipartite Graphs and their Null Set

✍ Scribed by Akbari, S.; Bahramian, S.

Book ID
121773559
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
186 KB
Volume
45
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Maximal sets of hamilton cycles in compl
Maximal sets of hamilton cycles in complete multipartite graphs
✍ Mike Daven; J. A. MacDougall; C. A. Rodger πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 154 KB πŸ‘ 2 views

## Abstract A set __S__ of edge‐disjoint hamilton cycles in a graph __G__ is said to be __maximal__ if the edges in the hamilton cycles in __S__ induce a subgraph __H__ of __G__ such that __G__β€‰βˆ’β€‰__E__(__H__) contains no hamilton cycles. In this context, the spectrum __S__(__G__) of a graph __G__ i

Critical groups for complete multipartit
Critical groups for complete multipartite graphs and Cartesian products of complete graphs
✍ Brian Jacobson; Andrew Niedermaier; Victor Reiner πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 147 KB

## Abstract The critical group of a connected graph is a finite abelian group, whose order is the number of spanning trees in the graph, and which is closely related to the graph Laplacian. Its group structure has been determined for relatively few classes of graphs, e.g., complete graphs and compl