Determination of (0,2)-regular sets in graphs
An eigenvalue of a graph is main iff its associated eigenspace is not orthogonal to the all-one vector j. The main characteristic polynomial of a graph G with p main distinct eigenvalues is _ (λ)=λ^−_0 λ^(−1)−_1 λ^(−2)-…-_(−2) λ−_(−1) and it has integer coefficients. If G has n vertices, the nxk wal...
Autor principal: | |
---|---|
Outros Autores: | , |
Formato: | conferenceObject |
Idioma: | eng |
Publicado em: |
2014
|
Assuntos: | |
Texto completo: | http://hdl.handle.net/10198/10660 |
País: | Portugal |
Oai: | oai:bibliotecadigital.ipb.pt:10198/10660 |