Learn More
We introduce and study an eigenvalue upper bound p(G) on the maximum cut mc (G) of a weighted graph. The function ~o(G) has several interesting properties that resemble the behaviour of mc (G). The following results are presented. We show that q~ is subadditive with respect to amalgam, and additive with respect to disjoint sum and 1-sum. We prove that ~(G)(More)
Relations between Laplacian eigenvectors and eigenvalues and the existence of almost equitable partitions (which are generalizations of equitable partitions) are presented. Furthermore, on the basis of some properties of the adjacency eigenvectors of a graph, a necessary and sufficient condition for the graph to be primitive strongly regular is introduced.
It is known that the Moore bipartite bound provides an upper bound on the order of a connected bipartite graph. In this paper we deal with bipartite graphs of maximum degree ∆ ≥ 2, diameter D ≥ 2 and defect 2 (having 2 vertices less than the Moore bipartite bound). We call such graphs bipartite (∆, D, −2)-graphs. We find that the eigenvalues other than ±∆(More)