A graph G is called integral or Laplacian integral if all the eigenvalues of the adjacency matrix A(G) or the Laplacian matrix Lap(G) = D(G)−A(G) of G are integers, where D(G) denote the diagonal matrix of the vertex degrees of G. Let Kn,n+1 ≡ Kn+1,n and K1,p[(p−1)Kp] denote the (n+1)-regular graph with 4n+2 vertices and the p-regular graph with p2 + 1 vertices, respectively. In this paper, we shall give the spectra and characteristic polynomials of Kn,n+1 ≡ Kn+1,n and K1,p[(p − 1)Kp] from the theory on matrices. We derive the characteristic poly-nomials for their complement graphs, their line graphs, the complement graphs of their line graphs and the line graphs of their complement graphs. We also obtain the numbers of spanning trees for ...
AbstractA graph is Laplacian integral if the spectrum of its Laplacian matrix consists of integers. ...
<p>In this paper we define extended corona and extended neighborhood<br />corona of two graphs $G_{1...
AbstractA graph G is called integral if all eigenvalues of its adjacency matrix A(G) are integers. I...
AbstractA graph is called integral if all its eigenvalues (of the adjacency matrix) are integers. In...
A graph is called integral if all its eigenvalues (of the adjacency matrix) are integers. In this pa...
A graph whose adjacency (Laplacian) matrix has a spectrum consisting only of integers is called (Lap...
This monograph deals with integral graphs, Laplacian integral regular graphs, cospectral graphs and ...
AbstractA graph is Laplacian integral if the spectrum of its Laplacian matrix consists entirely of i...
AbstractA graph is called integral if all the eigenvalues of its adjacency matrix are integers. In o...
Let Γ=V,E be a graph. If all the eigenvalues of the adjacency matrix of the graph Γ are integers, th...
AbstractA graph is called integral if all eigenvalues of its adjacency matrix are integers. In this ...
AbstractA graph is called a Laplacian integral graph if the spectrum of its Laplacian matrix consist...
A graph $G$ is called integral if all eigenvalues of its adjacency matrix $A(G)$ are integers. In th...
A graph is called integral if all the eigenvalues of its adjacency matrix are integers. In this pape...
AbstractA graph is called integral if all the eigenvalues of its adjacency matrix are integers. In t...
AbstractA graph is Laplacian integral if the spectrum of its Laplacian matrix consists of integers. ...
<p>In this paper we define extended corona and extended neighborhood<br />corona of two graphs $G_{1...
AbstractA graph G is called integral if all eigenvalues of its adjacency matrix A(G) are integers. I...
AbstractA graph is called integral if all its eigenvalues (of the adjacency matrix) are integers. In...
A graph is called integral if all its eigenvalues (of the adjacency matrix) are integers. In this pa...
A graph whose adjacency (Laplacian) matrix has a spectrum consisting only of integers is called (Lap...
This monograph deals with integral graphs, Laplacian integral regular graphs, cospectral graphs and ...
AbstractA graph is Laplacian integral if the spectrum of its Laplacian matrix consists entirely of i...
AbstractA graph is called integral if all the eigenvalues of its adjacency matrix are integers. In o...
Let Γ=V,E be a graph. If all the eigenvalues of the adjacency matrix of the graph Γ are integers, th...
AbstractA graph is called integral if all eigenvalues of its adjacency matrix are integers. In this ...
AbstractA graph is called a Laplacian integral graph if the spectrum of its Laplacian matrix consist...
A graph $G$ is called integral if all eigenvalues of its adjacency matrix $A(G)$ are integers. In th...
A graph is called integral if all the eigenvalues of its adjacency matrix are integers. In this pape...
AbstractA graph is called integral if all the eigenvalues of its adjacency matrix are integers. In t...
AbstractA graph is Laplacian integral if the spectrum of its Laplacian matrix consists of integers. ...
<p>In this paper we define extended corona and extended neighborhood<br />corona of two graphs $G_{1...
AbstractA graph G is called integral if all eigenvalues of its adjacency matrix A(G) are integers. I...