Add to ORKGIn this paper, we define duplication corona, duplication neighborhood corona and duplication edge corona of two graphs. We compute their adjacency spectrum, Laplacian spectrum and signless Laplacian. As an application, our results enable us to construct infinitely many pairs of cospectral graphs and also integral graphs. Keywords: Duplication corona, Duplication edge corona, Duplication neighborhood corona, Cospectral graphs, Integral graphs
AbstractA graph is Laplacian integral if the spectrum of its Laplacian matrix consists of integers. ...
A graph G is called integral or Laplacian integral if all the eigenvalues of the adjacency matrix A(...
We study combinatorial Laplacians of graphs, and provide examples of isospectral graphs, including f...
<p>In this paper we define extended corona and extended neighborhood<br />corona of two graphs $G_{1...
The subdivision graph S(G) of a graph G is the graph obtained by inserting a new vertex into every e...
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...
This monograph deals with integral graphs, Laplacian integral regular graphs, cospectral graphs and ...
AbstractWe introduce a new invariant, the coronal of a graph, and use it to compute the spectrum of ...
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...
AbstractLet G1,G2 be two simple connected graphs. Denote the corona and the edge corona of G1,G2 by ...
A graph whose adjacency (Laplacian) matrix has a spectrum consisting only of integers is called (Lap...
AbstractA graph is Laplacian integral if the spectrum of its Laplacian matrix consists entirely of i...
Let G and H be two graphs. The join G ∨ H is the graph obtained by joining every vertex of G with ev...
Coalescence or overlap of graphs is a significant operation involving two graphs, due to a nice expr...
AbstractA graph is Laplacian integral if the spectrum of its Laplacian matrix consists of integers. ...
A graph G is called integral or Laplacian integral if all the eigenvalues of the adjacency matrix A(...
We study combinatorial Laplacians of graphs, and provide examples of isospectral graphs, including f...
<p>In this paper we define extended corona and extended neighborhood<br />corona of two graphs $G_{1...
The subdivision graph S(G) of a graph G is the graph obtained by inserting a new vertex into every e...
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...
This monograph deals with integral graphs, Laplacian integral regular graphs, cospectral graphs and ...
AbstractWe introduce a new invariant, the coronal of a graph, and use it to compute the spectrum of ...
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...
AbstractLet G1,G2 be two simple connected graphs. Denote the corona and the edge corona of G1,G2 by ...
A graph whose adjacency (Laplacian) matrix has a spectrum consisting only of integers is called (Lap...
AbstractA graph is Laplacian integral if the spectrum of its Laplacian matrix consists entirely of i...
Let G and H be two graphs. The join G ∨ H is the graph obtained by joining every vertex of G with ev...
Coalescence or overlap of graphs is a significant operation involving two graphs, due to a nice expr...
AbstractA graph is Laplacian integral if the spectrum of its Laplacian matrix consists of integers. ...
A graph G is called integral or Laplacian integral if all the eigenvalues of the adjacency matrix A(...
We study combinatorial Laplacians of graphs, and provide examples of isospectral graphs, including f...