A minimizer graph, denoted by Gmin n,D, is a graph which has the minimal spectral radius among all connected graphs on n vertices with diameter D.So far, fo
A balanced bipartition of a graph G is a partition of V(G) into two subsets V1 and V2 that differ in cardinality by at most 1.A minimum balanced bipartition
Hajos conjectured that every simple even graph on n vertices can be decomposed into at most (n-1)/2 cycles (see L.Lovasz, On covering of graphs, in: P.Erdos