Abstract: Let Gl be the graph obtained from Kl by adhering the root of isomorphic trees T to every vertex of Kl. In this paper we study the spectrum of the adjacency matrix A(Gl) for all positive integer l and give some result about the spectrum of the adjacency matrix A(Gl). Key–Words: Adjacency matrix, complete graph, spectrum
Let G be a graph. The Laplacian matrix L(G)=D(G) -A)(G) is the difference of the diagonal matrix of ...
AbstractA graph is said to be determined by its adjacency spectrum (DS for short) if there is no oth...
AbstractThe largest eigenvalue of the adjacency matrix of a graph has received considerable attentio...
For almost all graphs the answer to the question in the title is still unknown. Here we survey the c...
AbstractFor almost all graphs the answer to the question in the title is still unknown. Here we surv...
bra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are deter...
AbstractIn [E.R. van Dam, W.H. Haemers, Which graphs are determined by their spectrum? Linear Algebr...
In this BSc thesis we deal with matrix graph theory. We are interested primarily in the eigenvalues ...
For almost all graphs the answer to the question in the title is still unknown. Here we survey the c...
In [E.R. van Dam, W.H. Haemers, Which graphs are determined by their spectrum? Linear Algebra Appl. ...
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Ap...
This chapter presents some simple results on graph spectra.We assume the reader is familiar with ele...
This chapter presents some simple results on graph spectra.We assume the reader is familiar with ele...
This chapter presents some simple results on graph spectra.We assume the reader is familiar with ele...
This chapter presents some simple results on graph spectra.We assume the reader is familiar with ele...
Let G be a graph. The Laplacian matrix L(G)=D(G) -A)(G) is the difference of the diagonal matrix of ...
AbstractA graph is said to be determined by its adjacency spectrum (DS for short) if there is no oth...
AbstractThe largest eigenvalue of the adjacency matrix of a graph has received considerable attentio...
For almost all graphs the answer to the question in the title is still unknown. Here we survey the c...
AbstractFor almost all graphs the answer to the question in the title is still unknown. Here we surv...
bra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are deter...
AbstractIn [E.R. van Dam, W.H. Haemers, Which graphs are determined by their spectrum? Linear Algebr...
In this BSc thesis we deal with matrix graph theory. We are interested primarily in the eigenvalues ...
For almost all graphs the answer to the question in the title is still unknown. Here we survey the c...
In [E.R. van Dam, W.H. Haemers, Which graphs are determined by their spectrum? Linear Algebra Appl. ...
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Ap...
This chapter presents some simple results on graph spectra.We assume the reader is familiar with ele...
This chapter presents some simple results on graph spectra.We assume the reader is familiar with ele...
This chapter presents some simple results on graph spectra.We assume the reader is familiar with ele...
This chapter presents some simple results on graph spectra.We assume the reader is familiar with ele...
Let G be a graph. The Laplacian matrix L(G)=D(G) -A)(G) is the difference of the diagonal matrix of ...
AbstractA graph is said to be determined by its adjacency spectrum (DS for short) if there is no oth...
AbstractThe largest eigenvalue of the adjacency matrix of a graph has received considerable attentio...
Add to ORKG