Eigenvalues of the perfect matching derangement graph
The perfect matching derangement graph M2n is the graph whose vertex set consists of the perfect matchings of the complete graph K2n such that two vertices (perfect matchings) are adjacent if and only if they have no edges in common, i.e. they are "derangement" with respect to each othe...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis-Doctor of Philosophy |
| Language: | English |
| Published: |
Nanyang Technological University
2023
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/168329 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |