𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Spectra of Simplicial Rook Graphs

✍ Scribed by Martin, Jeremy L.; Wagner, Jennifer D.

Book ID
125345655
Publisher
Springer Japan
Year
2014
Tongue
English
Weight
682 KB
Volume
31
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A tight lower bound on the maximum genus
A tight lower bound on the maximum genus of a simplicial graph
✍ Jianer Chen; Saroja P. Kanchi; Jonathan L. Gross πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 856 KB

It is proved that every connected simplicial graph with minimum valence at least three has maximum genus at least one-quarter of its cycle rank. This follows from the technical result that every 3-regular simplicial graph except K4 has a Xuong co-tree whose odd components have only one edge each. It