Search

A graph $G$ is divisible by a graph $H$ if the characteristic polynomial of $G$ is divisible by that of $H$. In this paper, a necessary and sufficient condition for recursive graphs to be divisible by a path is used to show that the H-shape graph $P_{2,2;n-4}^{2,n-7}$, known to be (for $n$ large enough) the minimizer of the spectral radius among the graphs of order $n$ and diameter $n-5$, is determined by its adjacency spectrum if and only if $n \neq 10,13,15$., Comment: 21 pages

The eccentricity matrix $\mathcal E(G)$ of a connected graph $G$ is obtained from the distance matrix of $G$ by leaving unchanged the largest nonzero entries in each row and each column, and replacing the remaining ones with zeros. In this paper, we consider the set $\mathcal C \mathcal T$ of clique trees whose blocks have at most two cut-vertices \textcolor{blue}{of the clique tree}. After proving the irreducibility of the eccentricity matrix of a clique tree in $\mathcal C \mathcal T$ and finding its inertia indices, we show that every graph in $\mathcal C \mathcal T$ with more than $4$ vertices and odd diameter has two positive and two negative $\mathcal E$-eigenvalues. Positive $\mathcal E$-eigenvalues and negative $\mathcal E$-eigenvalues turn out to be equal in number even for graphs in $\mathcal C \mathcal T$ with even diameter; that shared cardinality also counts the \textcolor{blue}{`diametrally distinguished'} vertices. Finally, we prove that the spectrum of the eccentricity matrix of a clique tree $G$ in $\mathcal C \mathcal T$ is symmetric with respect to the origin if and only if $G$ has an odd diameter and exactly two adjacent central vertices., Comment: 16

In 1972, A. J. Hoffman proved his celebrated theorem concerning the limit points of spectral radii of non-negative symmetric integral matrices less than $\sqrt{2+\sqrt{5}}$. In this paper, after giving a new version of Hoffman's theorem, we get two generalized versions of it applicable to non-negative symmetric matrices with fractional elements. As a corollary, we obtain another alternative version about the limit points of spectral radii of (signless) Laplacian matrices of graphs less than $2+ {\tiny \frac{{\;}1{\;}}{3}\left((54 - 6\sqrt{33})^{\frac{{\;}1{\;}}{3}} + (54 + 6\sqrt{33})^{\frac{{\;} 1{\;}}{3}} \right)}$. We also discuss how our approach could be fruitfully employed to investigate equiangular lines., Comment: 16 pages

The Hoffman program with respect to any real or complex square matrix $M$ associated to a graph $G$ stems from A. J. Hoffman's pioneering work on the limit points for the spectral radius of adjacency matrices of graphs less than $\sqrt{2+\sqrt{5}}$. The program consists of two aspects: finding all the possible limit points of $M$-spectral radii of graphs and detecting all the connected graphs whose $M$-spectral radius does not exceed a fixed limit point. In this paper, we summarize the results on this topic concerning several graph matrices, including the adjacency, the Laplacian, the signless Laplacian, the Hermitian adjacency and skew-adjacency matrix of graphs. As well, the tensors of hypergraphs are discussed. Moreover, we obtain new results about the Hoffman program with relation to the $A_\alpha$-matrix. Some further problems on this topic are also proposed., Comment: 26 pages, 10 figures

A well--known fact in Spectral Graph Theory is the existence of pairs of isospectral nonisomorphic graphs (known as PINGS). The work of A.J. Schwenk (in 1973) and of C. Godsil and B. McKay (in 1982) shed some light on the explanation of the presence of isospectral graphs, and they gave routines to construct PINGS. Here, we consider the Godsil-McKay--type routines developed for graphs, whose adjacency matrices are $(0,1)$-matrices, to the level of signed graphs, whose adjacency matrices allow the presence of $-1$'s. We show that, with suitable adaption, such routines can be successfully ported to signed graphs, and we can build pairs of cospectral switching nonisomorphic signed graphs., Comment: 13 pages, 4 figures

Let $p$ be any prime, and let ${\mathcal B}(p)$ be the algebra of operations on the cohomology ring of any cocommutative $\mathbb{F}_p$-Hopf algebra. In this paper we show that when $p$ is odd (and unlike the $p=2$ case), ${\mathcal B}(p)$ cannot become an object in the Singer category of $\mathbb{F}_p$-algebras with coproducts, if we require that coproducts act on the generators of ${\mathcal B}(p)$ coherently with their nature of cohomology operations

Unlike the p = 2 case, the universal Steenrod Algebra Q(p) at odd primes does not have a fractal structure that preserves the length of monomials. Nevertheless, when p is odd we detect inside Q(p) two different families of nested subalgebras each isomorphic (as length-graded algebras) to the respective starting element of the sequence