Add to ORKGThis monograph deals with integral graphs, Laplacian integral regular graphs, cospectral graphs and cospectral integral graphs. The organization of this work, which consists of eight chapters, is as follows
AbstractA graph is Laplacian integral if the spectrum of its Laplacian matrix consists of integers. ...
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...
This monograph deals with integral graphs, Laplacian integral regular graphs, cospectral graphs and ...
A graph $G$ is called {\it integral} if all zeros of the characteristic polynomial $P(G,x)$ are inte...
A graph G is called integral or Laplacian integral if all the eigenvalues of the adjacency matrix A(...
A graph is called integral if all its eigenvalues (of the adjacency matrix) are integers. In this pa...
AbstractA graph is called integral if all its eigenvalues (of the adjacency matrix) are integers. In...
In this paper, we define duplication corona, duplication neighborhood corona and duplication edge co...
AbstractA graph is Laplacian integral if the spectrum of its Laplacian matrix consists entirely of i...
A graph whose adjacency (Laplacian) matrix has a spectrum consisting only of integers is called (Lap...
AbstractA graph G is called integral if all eigenvalues of its adjacency matrix A(G) are integers. I...
A graph $G$ is called integral if all eigenvalues of its adjacency matrix $A(G)$ are integers. In th...
A graph X is said to be integral if all eigenvalues of the adjacency matrix of X are integers. This...
AbstractA graph is called a Laplacian integral graph if the spectrum of its Laplacian matrix consist...
AbstractA graph is Laplacian integral if the spectrum of its Laplacian matrix consists of integers. ...
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...
This monograph deals with integral graphs, Laplacian integral regular graphs, cospectral graphs and ...
A graph $G$ is called {\it integral} if all zeros of the characteristic polynomial $P(G,x)$ are inte...
A graph G is called integral or Laplacian integral if all the eigenvalues of the adjacency matrix A(...
A graph is called integral if all its eigenvalues (of the adjacency matrix) are integers. In this pa...
AbstractA graph is called integral if all its eigenvalues (of the adjacency matrix) are integers. In...
In this paper, we define duplication corona, duplication neighborhood corona and duplication edge co...
AbstractA graph is Laplacian integral if the spectrum of its Laplacian matrix consists entirely of i...
A graph whose adjacency (Laplacian) matrix has a spectrum consisting only of integers is called (Lap...
AbstractA graph G is called integral if all eigenvalues of its adjacency matrix A(G) are integers. I...
A graph $G$ is called integral if all eigenvalues of its adjacency matrix $A(G)$ are integers. In th...
A graph X is said to be integral if all eigenvalues of the adjacency matrix of X are integers. This...
AbstractA graph is called a Laplacian integral graph if the spectrum of its Laplacian matrix consist...
AbstractA graph is Laplacian integral if the spectrum of its Laplacian matrix consists of integers. ...
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...