On Hamiltonian Graphs with Maximal Index


We consider only finite undirected graphs without loops or multiple edges. The spectrum of a graph G is the spectrum of a real (0, I)-adjacency matrix of G, and the largest eigenvalue of such a matrix is called the index of G, here denoted by f.l(G). A central part of algebraic graph theory is concerned with relations between the structure of a graph and… (More)
DOI: 10.1016/S0195-6698(89)80023-X


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics