<p>In this paper we define extended corona and extended neighborhood<br />corona of two graphs $G_{1}$ and $G_{2}$, which are denoted by<br />$G_{1}\bullet G_{2}$ and $G_{1}\ast G_{2}$ respectively. We<br />compute their adjacency spectrum, Laplacian spectrum and signless<br />Laplacian spectrum. As applications, we give methods to construct<br />infinite families of integral graphs, Laplacian integral graphs<br />and expander graphs from known ones.</p
A graph whose adjacency (Laplacian) matrix has a spectrum consisting only of integers is called (Lap...
In this paper we determine the normalized Laplacian spectrum of the Q-vertex corona, Q-edge corona, ...
The Seidel spectrum of a graph is defined as the multiset of all eigenvalues of its Seidel matrix. R...
Given simple graphsG1 andG2, the neighbourhood corona ofG1 andG2, denotedG1?G2, is the graph obtaine...
In this paper, we define neighborhood complement corona of two graphs G(1) and G(2), which is denote...
In this paper, we define duplication corona, duplication neighborhood corona and duplication edge co...
The subdivision graph S(G) of a graph G is the graph obtained by inserting a new vertex into every e...
AbstractWe introduce a new invariant, the coronal of a graph, and use it to compute the spectrum of ...
AbstractLet G1,G2 be two simple connected graphs. Denote the corona and the edge corona of G1,G2 by ...
Let G and H be two graphs. The join G ∨ H is the graph obtained by joining every vertex of G with ev...
Let G = (V (G), E(G)) be a graph with vertex set V (G) and edge set E(G). The subdivi-sion graph S(G...
In this paper, we introduce a generalization of corona of graphs. This construction generalizes the ...
A graph G is called integral or Laplacian integral if all the eigenvalues of the adjacency matrix A(...
Coalescence or overlap of graphs is a significant operation involving two graphs, due to a nice expr...
Cioaba, Sebastian M.Algebraic combinatorics is the area of mathematics that uses the theories and me...
A graph whose adjacency (Laplacian) matrix has a spectrum consisting only of integers is called (Lap...
In this paper we determine the normalized Laplacian spectrum of the Q-vertex corona, Q-edge corona, ...
The Seidel spectrum of a graph is defined as the multiset of all eigenvalues of its Seidel matrix. R...
Given simple graphsG1 andG2, the neighbourhood corona ofG1 andG2, denotedG1?G2, is the graph obtaine...
In this paper, we define neighborhood complement corona of two graphs G(1) and G(2), which is denote...
In this paper, we define duplication corona, duplication neighborhood corona and duplication edge co...
The subdivision graph S(G) of a graph G is the graph obtained by inserting a new vertex into every e...
AbstractWe introduce a new invariant, the coronal of a graph, and use it to compute the spectrum of ...
AbstractLet G1,G2 be two simple connected graphs. Denote the corona and the edge corona of G1,G2 by ...
Let G and H be two graphs. The join G ∨ H is the graph obtained by joining every vertex of G with ev...
Let G = (V (G), E(G)) be a graph with vertex set V (G) and edge set E(G). The subdivi-sion graph S(G...
In this paper, we introduce a generalization of corona of graphs. This construction generalizes the ...
A graph G is called integral or Laplacian integral if all the eigenvalues of the adjacency matrix A(...
Coalescence or overlap of graphs is a significant operation involving two graphs, due to a nice expr...
Cioaba, Sebastian M.Algebraic combinatorics is the area of mathematics that uses the theories and me...
A graph whose adjacency (Laplacian) matrix has a spectrum consisting only of integers is called (Lap...
In this paper we determine the normalized Laplacian spectrum of the Q-vertex corona, Q-edge corona, ...
The Seidel spectrum of a graph is defined as the multiset of all eigenvalues of its Seidel matrix. R...