相关论文: On the spectral characterization of Kite graphs

Two graphs having the same spectrum are said to be cospectral. Two graphs such that the absolute values of their nonzero eigenvalues coincide are singularly cospectral graphs. Cospectrality implies singular cospectrality, but the converse…

In this paper, all graphs whose adjacency matrix has at most two eigenvalues (multiplicities included) different from $2$ and $-1$ are determined. These graphs conclude a class of generalized friendship graphs $F_{t,r,k}, $ which is the…

We consider two types of joins of graphs $G_{1}$ and $G_{2}$, $G_{1}\veebar G_{2}$ - the Neighbors Splitting Join and $G_{1}\underset{=}{\lor}G_{2}$ - the Non Neighbors Splitting Join, and compute the adjacency characteristic polynomial,…

We study covering graphs of the Paley graph associated to a finite field of characteristic p in the case where the covering transformation group is cyclic of prime order distinct from p. When the field has q = p elements, we show that the…

A $\mathbb{T}$-gain graph is a simple graph in which a unit complex number is assigned to each orientation of an edge, and its inverse is assigned to the opposite orientation. The associated adjacency matrix is defined canonically, and is…

Two graphs having the same spectrum are said to be cospectral. A pair of singularly cospectral graphs is formed by two graphs such that the absolute values of their nonzero eigenvalues coincide. Clearly, a pair of cospectral graphs is also…

Let $p$ be an odd prime, and $D_{2p}=\langle a,b\mid a^p=b^2=1,bab=a^{-1}\rangle$ the dihedral group of order $2p$. In this paper, we completely classify the cubic Cayley graphs on $D_{2p}$ up to isomorphism by means of spectral method. By…

Let $e$ be a positive integer, $p$ be an odd prime, $q=p^{e}$, and $\Bbb F_q$ be the finite field of $q$ elements. Let $f,g \in \Bbb F_q [X,Y]$. The graph $G=G_q(f,g)$ is a bipartite graph with vertex partitions $P=\Bbb F_q^3$ and $L=\Bbb…

An invariant for cospectral graphs is a property shared by all cospectral graphs. In this paper, we establish three novel arithmetic invariants for cospectral graphs, revealing deep connections between spectral properties and combinatorial…

We introduce a class of pairs of graphs consisting of two cliques joined by an arbitrary number of edges. The members of a pair have the property that the clique-bridging edge-set of one graph is the complement of that of the other. We…

A fundamental and challenging problem in spectral graph theory is to characterize which graphs are uniquely determined by their spectra. In Wang [J. Combin. Theory, Ser. B, 122 (2017): 438-451], the author proved that an $n$-vertex graph…

It is not hard to find many complete bipartite graphs which are not determined by their spectra. We show that the graph obtained by deleting an edge from a complete bipartite graph is determined by its spectrum. We provide some graphs, each…

Let $(X,E_X)$ and $(V,E_V)$ be finite connected graphs without loops. We assume that $V$ has two distinguished vertices $a,b$ and an automorphism $\gamma$ which exchanges $a$ and~$b$. The $V$-edge substitution of $X$ is the graph $X[V]$…

The simplex graph $S(G)$ of a graph $G$ is defined as the graph whose vertices are the cliques of $G$ (including the empty set), with two vertices being adjacent if, as cliques of $G$, they differ in exactly one vertex. Simplex graphs form…

Quantum graphs are defined by having a Laplacian defined on the edges of a metric graph with boundary conditions on each vertex such that the resulting operator, $\mathbf{L}$, is self-adjoint. We use Neumann boundary conditions although we…

Let $B$ and $R$ be two simple graphs with vertex set $V$, and let $G(B,R)$ be the simple graph with vertex set $V$, in which two vertices are adjacent if they are adjacent in at least one of $B$ and $R$. For $X \subseteq V$, we denote by…

The main goal of the paper is to characterize new classes of multicone graphs which are determined by both adjacency and Laplacian spectra. A multicone graph is defined to be the join of a clique and a regular graph. A wheel graph obtained…

Let $k\ge 3$ be an integer, $q$ be a prime power, and $\mathbb{F}_q$ denote the field of $q$ elements. Let $f_i, g_i\in\mathbb{F}_q[X]$, $3\le i\le k$, such that $g_i(-X) = -\, g_i(X)$. We define a graph $S(k,q) =…

We examine the capacity of the complementarity spectrum to distinguish non-isomorphic digraphs. We focus on the seven families with exactly three complementarity eigenvalues. Our findings reveal that in some, but not all families, any two…

For any positive definite rational quadratic form $q$ of $n$ variables let $G(\mathbb{Q}^n, q)$ denote the graph with vertices $\mathbb{Q}^n$ and $x, y \in \mathbb{Q}^n$ connected iff $q(x - y) = 1$. This notion generalises standard…