This research monograph summarizes a line of research that maps certain classical problems of discrete mathematics and operations research-such as the Hamiltonian Cycle …
A set of graphs are called cospectral if their adjacency matrices have the same characteristic polynomial. In this paper we introduce a simple method for constructing infinite families of …
JA Filar, M Haythorpe, S Rossomakhine - Computers & Operations …, 2015 - Elsevier
We analyse a polyhedron which contains the convex hull of all Hamiltonian cycles of a given undirected connected cubic graph. Our constructed polyhedron is defined by polynomially …
VS Borkar, V Ejov, JA Filar, GT Nguyen… - … Cycle Problem and …, 2012 - Springer
Graph enumeration is a study in graph theory that deals with counting nonisomorphic graphs that have a particular property. Harary and Palmer [58] provide an excellent …