The adjacency operator of a graph has a spectrum and a class of scalar-valued spectral measures which have been systematically analyzed; it also has a spectral multiplicity function which has been less studied. The first purpose of this article is to review a small number of examples of infinite graphs $G = (V,E)$ for which the spectral multiplicity function of the adjacency operator $A_G$ of $G$ has been determined. The second purpose of this article is to show explicit examples of infinite connected graphs which are cospectral, i.e., which have unitarily equivalent adjacency operators
This thesis Entitled On Infinite graphs and related matrices.ln the last two decades (iraph theory h...
AbstractLet J be the all-ones matrix, and let A denote the adjacency matrix of a graph. An old resul...
AbstractA graph is said to be determined by its adjacency spectrum (DS for short) if there is no oth...
We analyze the singular spectrum of selfadjoint operators which arise from pasting a finite number o...
AbstractThe spectrum of a locally finite countable graph is defined. Some theorems known from the th...
AbstractLet G be a locally finite graph with bounded vertex degrees. Its adjacency matrix A gives ri...
AbstractFor almost all graphs the answer to the question in the title is still unknown. Here we surv...
Given a graph G we can form a matrix A_G indexed by the vertices of G and which encodes the edges of...
Spectral graph theory is a captivating area of graph theory that employs the eigenvalues and eigenve...
Spectral graph theory is a captivating area of graph theory that employs the eigenvalues and eigenve...
We consider selfadjoint operators obtained by pasting a finite number of boundary relations with one...
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Ap...
summary:A multicone graph is defined to be the join of a clique and a regular graph. Based on Zhou a...
AbstractLet G be a locally finite graph with bounded vertex degrees. Its adjacency matrix A gives ri...
summary:A multicone graph is defined to be the join of a clique and a regular graph. Based on Zhou a...
This thesis Entitled On Infinite graphs and related matrices.ln the last two decades (iraph theory h...
AbstractLet J be the all-ones matrix, and let A denote the adjacency matrix of a graph. An old resul...
AbstractA graph is said to be determined by its adjacency spectrum (DS for short) if there is no oth...
We analyze the singular spectrum of selfadjoint operators which arise from pasting a finite number o...
AbstractThe spectrum of a locally finite countable graph is defined. Some theorems known from the th...
AbstractLet G be a locally finite graph with bounded vertex degrees. Its adjacency matrix A gives ri...
AbstractFor almost all graphs the answer to the question in the title is still unknown. Here we surv...
Given a graph G we can form a matrix A_G indexed by the vertices of G and which encodes the edges of...
Spectral graph theory is a captivating area of graph theory that employs the eigenvalues and eigenve...
Spectral graph theory is a captivating area of graph theory that employs the eigenvalues and eigenve...
We consider selfadjoint operators obtained by pasting a finite number of boundary relations with one...
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Ap...
summary:A multicone graph is defined to be the join of a clique and a regular graph. Based on Zhou a...
AbstractLet G be a locally finite graph with bounded vertex degrees. Its adjacency matrix A gives ri...
summary:A multicone graph is defined to be the join of a clique and a regular graph. Based on Zhou a...
This thesis Entitled On Infinite graphs and related matrices.ln the last two decades (iraph theory h...
AbstractLet J be the all-ones matrix, and let A denote the adjacency matrix of a graph. An old resul...
AbstractA graph is said to be determined by its adjacency spectrum (DS for short) if there is no oth...