9 results on '"Adjacency matrix"'
Search Results
2. Spectral radius and Hamiltonian properties of graphs.
3. Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian.
4. On unicyclic non-bipartite graphs with tricyclic inverses.
5. Some generalizations of spectral conditions for 2s-hamiltonicity and 2s-traceability of bipartite graphs.
6. Upper bounds on scrambling index for non-primitive digraphs.
7. Spectral radius and Hamiltonian properties of graphs, II.
8. Some sufficient spectral conditions on Hamilton-connected and traceable graphs.
9. Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.