Necessary and sufficient conditions for a Hamiltonian graph
A graph is singular if the zero eigenvalue is in the spectrum of its 0-1 adjacency matrix A. If an eigenvector belonging to the zero eigenspace of A has no zero entries, then the singular graph is said to be a core graph. A ( k,t)-regular set is a subset of the vertices inducing a k -regular subgrap...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | article |
| Language: | eng |
| Published: |
2015
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10773/13474 |
| Country: | Portugal |
| Oai: | oai:ria.ua.pt:10773/13474 |