Characterization of graphs with exactly two non-negative eigenvalues Page 1 Also available at
http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS …

Written for mathematicians working with the theory of graph spectra, this (primarily
theoretical) book presents relevant results considering the spectral properties of regular …

Richard Brualdi proposed in [Research problems from the Aveiro workshop on graph
spectra, Linear Algebra Appl. 2007; 423: 172–181] the following problem:(Problem AWGS …

The von Neumann graph entropy (VNGE) can be used as a measure of graph complexity,
which can be the measure of information divergence and distance between graphs …

Let G be a graph on n vertices and consider the adjacency spectrum of G as the ordered n-
tuple whose entries are eigenvalues of G written decreasingly. Let G and H be two non …

In this paper, a new measurement to compare two large-scale graphs based on the theory of
quantum probability is proposed. An explicit form for the spectral distribution of the …

Abstract Let G=(V, E) be a simple graph of order n. The normalized Laplacian eigenvalues of
graph G are denoted by ρ 1 (G)≥ ρ 2 (G)≥⋯≥ ρ n− 1 (G)≥ ρ n (G)= 0. Also let G and G …

Some Spectral Characterizations of Equienergetic Regular Graphs and Their Complements
Page 1 Some Spectral Characterizations of Equienergetic Regular Graphs and Their …

Let G n and G n′ be two nonisomorphic graphs on n vertices with spectra (with respect to
the adjacency matrix) λ 1≥ λ 2≥⋯≥ λ n and λ 1′≥ λ 2′≥⋯≥ λ n′, respectively. Define …

The Slater index $ i (T) $ of a tournament $ T $ is the minimum number of arcs that must be
reversed to make $ T $ transitive. In this paper, we define a parameter $\Lambda (T) $ from …