We introduce a non-backtracking Laplace operator for graphs and we investigate its spectral properties. With the use of both theoretical and computational techniques, we show that the spectrum of this operator captures several structural properties of the graph in a more precise way than the classical operators that have been studied so far in the literature, including the non-backtracking matrix
Using Lotker’s interlacing theorem on the Laplacian eigenvalues of a graph in [5] and Wang and Bela...
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...
AbstractWe survey properties of spectra of signless Laplacians of graphs and discuss possibilities f...
This thesis deals with spectral graph theory issues relating to questions of spectral theory of non ...
Abstract. A spectral graph theory is a theory in which graphs are studied by means of eigenvalues of...
Cette thèse traite des questions de théorie spectrale des graphes portant sur les opérateurs non aut...
International audienceWe consider a non self-adjoint Laplacian on a directed graph with non symmetri...
International audienceA non-backtracking walk on a graph is a directed path such that no edge is the...
AbstractWe consider the class of graphs each of whose components is either a path or a cycle. We cla...
We survey properties of spectra of signless Laplacians of graphs and discuss possibilities for devel...
On finite metric graphs we consider Laplace operators, subject to various classes of non-self-adjoin...
Matrices and graphs are characterized by their spectral properties. Useful information on graps can ...
This thesis is devoted to inverse spectral problems for Laplace operators on metric graphs, and it i...
International audienceWe consider a non self-adjoint Laplacian on a directed graph with non symmetri...
Using Lotker’s interlacing theorem on the Laplacian eigenvalues of a graph in [5] and Wang and Bela...
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...
AbstractWe survey properties of spectra of signless Laplacians of graphs and discuss possibilities f...
This thesis deals with spectral graph theory issues relating to questions of spectral theory of non ...
Abstract. A spectral graph theory is a theory in which graphs are studied by means of eigenvalues of...
Cette thèse traite des questions de théorie spectrale des graphes portant sur les opérateurs non aut...
International audienceWe consider a non self-adjoint Laplacian on a directed graph with non symmetri...
International audienceA non-backtracking walk on a graph is a directed path such that no edge is the...
AbstractWe consider the class of graphs each of whose components is either a path or a cycle. We cla...
We survey properties of spectra of signless Laplacians of graphs and discuss possibilities for devel...
On finite metric graphs we consider Laplace operators, subject to various classes of non-self-adjoin...
Matrices and graphs are characterized by their spectral properties. Useful information on graps can ...
This thesis is devoted to inverse spectral problems for Laplace operators on metric graphs, and it i...
International audienceWe consider a non self-adjoint Laplacian on a directed graph with non symmetri...
Using Lotker’s interlacing theorem on the Laplacian eigenvalues of a graph in [5] and Wang and Bela...
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...