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...
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | conferenceObject |
| Language: | eng |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10198/10660 |
| Country: | Portugal |
| Oai: | oai:bibliotecadigital.ipb.pt:10198/10660 |