We study the first eigenvalue of the p- Laplacian (with 1 < p< ∞) on a quantum graph with Dirichlet or Kirchoff boundary conditions on the nodes. We find lower and upper bounds for this eigenvalue when we prescribe the total sum of the lengths of the edges and the number of Dirichlet nodes of the graph. Also we find a formula for the shape derivative of the first eigenvalue (assuming that it is simple) when we perturb the graph by changing the length of an edge. Finally, we study in detail the limit cases p→ ∞ and p→ 1.Fil: del Pezzo, Leandro Martin. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Rossi, Ju...
A quantum graph is a weighted combinatorial graph equipped with a Hamiltonian operator acting on fun...
We investigate quantum graphs with infinitely many vertices and edges without the common restriction...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
Abstract. We study the first eigenvalue of the p−Laplacian (with 1 < p < ∞) on a quantum graph...
(will be inserted by the editor) The first eigenvalue of the p−Laplacian on quantum graph
In this paper, the spectrum of the Neumann Laplacian for a graph with boundary is studied. Two compa...
AbstractA notion of splines is introduced on a quantum graph Γ. It is shown that eigen values of a H...
AbstractThis paper is concerned with techniques for quantitative analysis of the largest p-Laplacian...
We deal with the clustering problem in a metric graph. We look for two clusters, and to this end, we...
This thesis consists of four papers concerning topics in the spectral theory of quantum graphs, whic...
We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In p...
We develop a nonlinear spectral graph theory, in which the Laplace operator is replaced by the 1 - L...
We show that if µj is the jth largest Laplacian eigenvalue, and dj is the jth largest degree (1 = j ...
In this paper, we are concerned with upper bounds of eigenvalues of Laplace operator on compact Riem...
Let qmin(G) stand for the smallest eigenvalue of the signless Laplacian of a graph G of order n. Thi...
A quantum graph is a weighted combinatorial graph equipped with a Hamiltonian operator acting on fun...
We investigate quantum graphs with infinitely many vertices and edges without the common restriction...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
Abstract. We study the first eigenvalue of the p−Laplacian (with 1 < p < ∞) on a quantum graph...
(will be inserted by the editor) The first eigenvalue of the p−Laplacian on quantum graph
In this paper, the spectrum of the Neumann Laplacian for a graph with boundary is studied. Two compa...
AbstractA notion of splines is introduced on a quantum graph Γ. It is shown that eigen values of a H...
AbstractThis paper is concerned with techniques for quantitative analysis of the largest p-Laplacian...
We deal with the clustering problem in a metric graph. We look for two clusters, and to this end, we...
This thesis consists of four papers concerning topics in the spectral theory of quantum graphs, whic...
We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In p...
We develop a nonlinear spectral graph theory, in which the Laplace operator is replaced by the 1 - L...
We show that if µj is the jth largest Laplacian eigenvalue, and dj is the jth largest degree (1 = j ...
In this paper, we are concerned with upper bounds of eigenvalues of Laplace operator on compact Riem...
Let qmin(G) stand for the smallest eigenvalue of the signless Laplacian of a graph G of order n. Thi...
A quantum graph is a weighted combinatorial graph equipped with a Hamiltonian operator acting on fun...
We investigate quantum graphs with infinitely many vertices and edges without the common restriction...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...