In search of a poset structure to the regular exceptional graphs
A (k,t)-regular set is a subset of the vertices of a graph, inducing a k -regular subgraph such that every vertex not in the subset has t neighbors in it. An exceptional graph is a connected graph with least eigenvalue greater than or equal to -2 which is not a generalized line graph, and it is show...
Autor principal: | |
---|---|
Outros Autores: | , |
Formato: | conferenceObject |
Idioma: | eng |
Publicado em: |
2014
|
Assuntos: | |
Texto completo: | http://hdl.handle.net/10198/10677 |
País: | Portugal |
Oai: | oai:bibliotecadigital.ipb.pt:10198/10677 |