The construction of the poset of regular execeptional graphs using equitable partitions
An exceptional graph is a connected graph with least eigenvalue greater than or equal to -2 which is not a generalized line graph. It is shown that the set of regular exceptional graphs is partitioned in three layers. A (k,t)-regular set is a subset of the vertices of a graph, inducing a k-regular s...
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | conferenceObject |
| Language: | eng |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10198/10902 |
| Country: | Portugal |
| Oai: | oai:bibliotecadigital.ipb.pt:10198/10902 |