Related papers: M-accretive Laplacian on a non symmetric graph
We study the symmetry properties of the spectra of normalized Laplacians on signed graphs. We find a new machinery that generates symmetric spectra for signed graphs, which includes bipartiteness of unsigned graphs as a special case.…
We discuss Laplacians on graphs in a framework of regular Dirichlet forms. We focus on phenomena related to unboundedness of the Laplacians. This includes (failure of) essential selfadjointness, absence of essential spectrum and stochastic…
In this paper we introduce and study generally non-self-adjoint realizations of the Dirac operator on an arbitrary finite metric graph. Employing the robust boundary triple framework, we derive, in particular, a variant of the Birman…
We study the uniqueness of self-adjoint and Markovian extensions of the Laplacian on weighted graphs. We first show that, for locally finite graphs and a certain family of metrics, completeness of the graph implies uniqueness of these…
Laplace operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. Assuming rational independence of edge lengths, necessary and sufficient…
We develop eigenvalue estimates for the Laplacians on discrete and metric graphs using different types of boundary conditions at the vertices of the metric graph. Via an explicit correspondence of the equilateral metric and discrete graph…
In this article we study the well-posedness (uniqueness and existence of solutions) of nonlinear elliptic Partial Differential Equations (PDEs) on a finite graph. These results are obtained using the discrete comparison principle and…
A metrized graph is a compact singular 1-manifold endowed with a metric. A given metrized graph can be modelled by a family of weighted combinatorial graphs. If one chooses a sequence of models from this family such that the vertices become…
In this paper, we introduce the notion of oriented faces especially triangles in a connected oriented locally finite graph. This framework then permits to define the Laplace operator on this structure of the 2-simplicial complex. We develop…
We discuss connections between the essential self-adjointness of a symmetric operator and the constancy of functions which are in the kernel of the adjoint of the operator. We then illustrate this relationship in the case of Laplacians on…
We consider compact metric graphs with an arbitrary self adjoint realisation of the differential Laplacian. After discussing spectral properties of Laplacians, we prove several versions of trace formulae, relating Laplace spectra to sums…
In this paper, we derive Li-Yau inequality for unbounded Laplacian on complete weighted graphs with the assumption of the curvature-dimension inequality $CDE'(n,K)$, which can be regarded as a notion of curvature on graphs. Furthermore, we…
We consider metric graphs with a uniform lower bound on the edge lengths but no further restrictions. We discuss how to describe every local self-adjoint Laplace operator on such graphs by boundary conditions in the vertices given by…
We study the discrete version of the $p$-Laplacian. Based on its variational properties we discuss some features of the associated parabolic problem. Our approach allows us in turn to obtain interesting information about positivity and…
We write the spectral zeta function of the Laplace operator on an equilateral metric graph in terms of the spectral zeta function of the normalized Laplace operator on the corresponding discrete graph. To do this, we apply a relation…
We provide certain compatibility conditions for m-accretive operators such that the adjoint of the sum is given by the closure of the sum of the respective adjoint. We revisit the proof of well-posedness of the abstract class of partial…
We study spectral properties of the standard (also called Kirchhoff) Laplacian and the anti-standard (or anti-Kirchhoff) Laplacian on a finite, compact metric graph. We show that the positive eigenvalues of these two operators coincide…
A matching M is a dominating induced matching of a graph, if every edge of the graph is either in $M$ or has a common end-vertex with exactly one edge in $M$. The concept of complete dominating induced matching is introduced as graphs where…
There are two main notions of a Laplacian operator associated with graphs: discrete graph Laplacians and continuous Laplacians on metric graphs (widely known as quantum graphs). Both objects have a venerable history as they are related to…
In this paper we generalise the results on eigenvalues and eigenvectors of unnormalized (combinatorial) Laplacian of two-dimensional grid presented by Edwards:2013 first to a grid graph of any dimension, and second also to other types of…