368 research outputs found

    Revisiting two classical results on graph spectra

    Full text link
    Let mu(G) and mu_min(G) be the largest and smallest eigenvalues of the adjacency matricx of a graph G. We refine quantitatively the following two results on graph spectra. (i) if H is a proper subgraph of a connected graph G, then mu(G)>mu(H). (ii) if G is a connected nonbipartite graph, then mu(G)>-mu_min(G)

    Graphs with many copies of a given subgraph

    Full text link
    We show that if a graph G of order n contains many copies of a given subgraph H, then it contains a blow-up of H of order log n

    Beyond graph energy: norms of graphs and matrices

    Full text link
    In 1978 Gutman introduced the energy of a graph as the sum of the absolute values of graph eigenvalues, and ever since then graph energy has been intensively studied. Since graph energy is the trace norm of the adjacency matrix, matrix norms provide a natural background for its study. Thus, this paper surveys research on matrix norms that aims to expand and advance the study of graph energy. The focus is exclusively on the Ky Fan and the Schatten norms, both generalizing and enriching the trace norm. As it turns out, the study of extremal properties of these norms leads to numerous analytic problems with deep roots in combinatorics. The survey brings to the fore the exceptional role of Hadamard matrices, conference matrices, and conference graphs in matrix norms. In addition, a vast new matrix class is studied, a relaxation of symmetric Hadamard matrices. The survey presents solutions to just a fraction of a larger body of similar problems bonding analysis to combinatorics. Thus, open problems and questions are raised to outline topics for further investigation.Comment: 54 pages. V2 fixes many typos, and gives some new materia

    Bounds on graph eigenvalues II

    Get PDF
    Some recent results on graph eigenvalues are improved. In particular, among all graphs of given order with no cliques of order (r+1)(r+1) the rr-partite Turan graph has maximal spectral radius
    corecore