Equiarboreal graphs |
| |
| Authors: | C D Godsil |
| |
| Institution: | 1. Institut für Mathematik und Angewandte Geometrie Montanuniversit?t Leoben, A-8700, Leoben, Austria
|
| |
| Abstract: | A graphX is said to beequiarboreal if the number of spanning trees containing a specified edge inX is independent of the choice of edge. We prove that any graph which is a colour class in an association scheme (and thus
any distance regular graph) is equiarboreal. We note that a connected equiarboreal graph withM edges andn vertices has edge-connectivity at leastM/(n−1). |
| |
| Keywords: | 05 C 05 05 B 30 15 A 18 05 C 40 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
