9 research outputs found

    Extremal graphs for Estrada indices

    Get PDF
    Let G\mathcal{G} be a simple undirected connected graph. The signless Laplacian Estrada, Laplacian Estrada and Estrada indices of a graph G\mathcal{G} is the sum of the exponentials of the signless Laplacian eigenvalues, Laplacian eigenvalues and eigenvalues of G\mathcal{G}, respectively. The present work derives an upper bound for the Estrada index of a graph as a function of its chromatic number, in the family of graphs whose color classes have order not less than a fixed positive integer. The graphs for which the upper bound is tight is obtained. Additionally, an upper bound for the Estrada Index of the complement of a graph in the previous family of graphs with two color classes is given. A Nordhaus-Gaddum type inequality for the Laplacian Estrada index when {G\mathcal{G} is a bipartite} graph with color classes of order not less than 22, is presented. Moreover, a sharp upper bound for the Estrada index of the line graph and for the signless Laplacian index of a graph in terms of connectivity is obtained.publishe

    On the Spectral properties of power graphs over certain groups

    Full text link
    The power graph P(Ω)P(\Omega) of a group Ω\Omega is a graph with the vertex set Ω\Omega such that two distinct vertices form an edge if and only if one of them is an integral power of the other. In this article, we determine the power graph of the group G=⟨s,r :r2kp=s2=e, srs−1=r2k−1p−1⟩\mathcal{G} = \langle s,r \, : r^{2^kp} = s^2 = e,~ srs^{-1} = r^{2^{k-1}p-1}\rangle. Further, we compute its characteristic polynomial for the adjacency, Laplacian, and signless Laplacian matrices associated with this power graph. In addition, we determine its spectrum, Laplacian spectrum, and Laplacian energy.Comment: 17 page

    An interlacing property of the signless Laplacian of threshold graphs

    Full text link
    We show that for threshold graphs, the eigenvalues of the signless Laplacian matrix interlace with the degrees of the vertices. As an application, we show that the signless Brouwer conjecture holds for threshold graphs, i.e., for threshold graphs the sum of the k largest eigenvalues is bounded by the number of edges plus k + 1 choose 2.Comment: 14 pages, 3 figure

    Spectral properties of digraphs with a fixed dichromatic number

    Get PDF

    On the energy of symmetric matrices and Coulson's integral formula

    Get PDF
    We dene the outer energy of a real symmetric matrix M for the eigenvalues λ1, …, λn of M and their arithmetic mean λ(M). We discuss the properties of the outer energy in contrast to the inner energy defined as Einn(M) = ∑ni = 1 |λi|. We prove that Einn is the maximum among the energy functions e: S(n) → R and Eout among functions f(M - λ(M)1n), where f is an energy function. We prove a variant of the Coulson integral formula for the outer energy

    Discrete Mathematics and Symmetry

    Get PDF
    Some of the most beautiful studies in Mathematics are related to Symmetry and Geometry. For this reason, we select here some contributions about such aspects and Discrete Geometry. As we know, Symmetry in a system means invariance of its elements under conditions of transformations. When we consider network structures, symmetry means invariance of adjacency of nodes under the permutations of node set. The graph isomorphism is an equivalence relation on the set of graphs. Therefore, it partitions the class of all graphs into equivalence classes. The underlying idea of isomorphism is that some objects have the same structure if we omit the individual character of their components. A set of graphs isomorphic to each other is denominated as an isomorphism class of graphs. The automorphism of a graph will be an isomorphism from G onto itself. The family of all automorphisms of a graph G is a permutation group
    corecore