相关论文: Constructions of $A_\alpha$-cospectral graphs usin…

Given two signed graphs $\Gamma_1$ with nodes $\{u_1,u_2,\cdots,u_n\}$ and $\Gamma_2$, the neighbourhood corona, $\Gamma_1*\Gamma_2$ is the signed graph obtained by taking one copy of $\Gamma_1$ and $n_1$ copies of $\Gamma_2$, and joining…

Let $G_1$ and $G_2$ be two graphs on disjoint sets of $n_1$ and $n_2$ vertices, respectively. The corona of graphs $G_1$ and $G_2$, denoted by $G_1\circ G_2$, is the graph formed from one copy of $G_1$ and $n_1$ copies of $G_2$ where the…

In this paper, we define a ternary graph operation which generalizes the construction of subdivision graph, $R-$graph, central graph. Also, it generalizes the construction of overlay graph (Marius Somodi \emph{et al.}, 2017), and…

In this paper, we introduce central vertex corona, central edge corona, and central edge neighborhood corona of graphs using central graph. Also, we determine their adjacency spectrum, Laplacian spectrum and signless Laplacian spectrum.…

The following problem has been proposed in [Research problems from the Aveiro workshop on graph spectra, {\em Linear Algebra and its Applications}, {\bf 423} (2007) 172-181.]:\\ (Problem AWGS.4) Let $G_n$ and $G'_n$ be two nonisomorphic…

This paper introduces the concept of $\mu$-signed and duplication signed graphs and shows that both are always structurally balanced. Using the duplication signed graph, we define the corona product of the duplication signed graph…

Let $\core G$ and $\corona G$ denote the intersection and the union, respectively, of all maximum independent sets of a graph $G$. In this work, we show that for a graph with at most two odd cycles, $\a{\core G}+\a{\corona G}$ is equal to…

Two graphs $G$ and $H$ are \emph{cospectral} if the adjacency matrices share the same spectrum. Constructing cospectral non-isomorphic graphs has been studied extensively for many years and various constructions are known in the literature,…

In this paper, we extend our earlier proposal of corona product of signed graphs into generalized corona product of signed graphs inspired by the generalized corona product of unsigned graphs. Then we study structural balance and spectral…

Two types of corona products for simple directed graphs are introduced, extending the classical notions from the undirected setting: the vertex-corona and the arc-corona. Their structural and spectral properties are investigated through the…

Let $G$ be a graph with adjacency matrix $A(G)$, and let $D(G)$ be the diagonal matrix of the degrees of $G$. For any real $\alpha\in[0,1]$, write $A_\alpha(G)$ for the matrix $$A_\alpha(G)=\alpha D(G)+(1-\alpha)A(G).$$ This paper presents…

Here, we represent a general hypergraph by a matrix and study its spectrum. We extend the definition of equitable partition and joining operation for hypergraphs, and use those to compute eigenvalues of different hypergraphs. We derive the…

An automorphism of a graph describes its structural symmetry and the concept of fixing number of a graph is used for breaking its symmetries (except the trivial one). In this paper, we evaluate automorphisms of the co-normal product graph…

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,…

Let $G$ be a finite simple graph with the vertex set $V$ and let $I_G$ be its edge ideal in the polynomial ring $S=\mathbb{K}[x_V]$. In this paper, we compute the depth and the Castelnuovo--Mumford regularity of $S/I_G$ when $G=G_1\circ…

The $\alpha$-spectral radius of a connected graph $G$ is the spectral radius of $A_\alpha$-matrix of $G$. In this paper, we discuss the methods for comparing $\alpha$-spectral radius of graphs. As applications, we characterize the graphs…

A signed graph $S=(G, \sigma)$ is a pair in which $G$ is an underlying graph and $\sigma$ is a function from the edge set to $\{\pm1\}$. For signed graphs $S_{1}$ and $S_{2}$ on $n_{1}$ and $n_{2}$ vertices, respectively, the signed…

The subdivision graph $\mathcal{S}(G)$ of a graph $G$ is the graph obtained by inserting a new vertex into every edge of $G$. Let $G_1$ and $G_2$ be two vertex disjoint graphs. The \emph{subdivision-vertex join} of $G_1$ and $G_2$, denoted…

For vertex and edge connectivity we construct infinitely many pairs of regular graphs with the same spectrum, but with different connectivity.

For a simple connected graph $G$, the $Q$-generating function of the numbers $N_k$ of semi-edge walks of length $k$ in $G$ is defined by $W_Q(t)=\sum\nolimits_{k = 0}^\infty {N_k t^k }$. This paper reveals that the $Q$-generating function…