Articles
Relations between spectrum curves of discrete Sturm – Liouville problem with nonlocal boundary conditions and graph theory
Diskrečiojo Šturmo ir Liuvilio uždavinio su nelokaliosiomis kraštine˙mis sąlygomis spektriniu˛ kreiviu˛ ir grafu˛ teorijos sąsajos
Relations between spectrum curves of discrete Sturm – Liouville problem with nonlocal boundary conditions and graph theory
Lietuvos matematikos rinkinys, vol. 61 Ser. A, pp. 1-6, 2020
Vilniaus Universitetas

Recepción: 01 Diciembre 2020
Publicación: 18 Febrero 2021
Abstract: Sturm – Liouville problem with nonlocal boundary conditions arises in many scientific fields such as chemistry, physics, or biology. There could be found some references to graph theory in a discrete Sturm–Liouville problem, especially in investigation of spectrum curves. In this paper, relations between discrete Sturm–Liouville problem with nonlocal boundary conditions characteristics (poles, critical points, spectrum curves) and graphs characteristics (vertices, edges and faces) were found.
Keywords: Sturm–Liouville problem, spectrum curves, nonlocal boundary conditions, graphs.
Summary: Šturmo ir Liuvilio uždavinys su nelokaliosiomis kraštine˙mis sąlygomis iškyla daugelyje mokslo šaku˛, tokiose kaip chemija, fizika ar biologija. Diskretizavus ši˛ uždavini˛ bei išnagrine˙jus spektrines kreives, galima ˛ižvelgti grafu˛ teorijos motyvu˛. Šiame straipsnyje pristatomos sąsajos tarp diskrečiojo Šturmo ir Liuvilio uždavinio su nelokaliosiomis kraštine˙mis sąlygomis (poliai, kritiniai taškai ir spektrine˙s kreive˙s) bei grafu˛ charakteristiku˛ (viršu¯ne˙s, briaunos ir veidai).
Keywords: Šturmo ir Liuvilio uždavinys, spektrine˙s kreive˙s, nelokaliosios kraštine˙s sąlygos, grafai.
1 A discrete Sturm–Liouville Problem
In this paper, particular properties of the spectrum of a discrete Sturm–Liouville Problem (dSLP) [1, 5, 6] with Nonlocal Boundary Conditions (NBCs) were found using Euler’s charakteristic formula [4].
We introduce a uniform grid and we use notation for and .
Also, we make an assumption that ξ is located on the grid, i.e., ξ = mh = m/n, 0 < m < n. We denote .
Let us consider a dSLP (an approximation by Finite-Difference Scheme)

λ ∈ C with classical discrete Dirichlet or Neumann Boundary Condition (BC)
and NBC:
So, we have four cases of BCs: a) (2d)–(30), b) (2d)–(31), c) (2n)–(30), d) (2n)–(31). We denote and and N := n/K, M := m/K in the case a), b), and and in the case c).
Let us consider a bijection (see [2])
between and
The
general solution
Then by using BCs (2) and (3) we get an equation:
where functions Zh(q) and Ph(q) are determined in Table 1.
Constant Eigenvalues. For any constant eigenvalue λ ∈ Cλ there exists the Constant Eigenvalue Point (CEP) q ∈ Cq. CEP are roots of the system [2]:
For every CEP cj we define nonregular Spectrum Curve Nj = {cj}.
![Spectrum Curves [1].](../692674643001_gf2.png)
Nonconstant eigenvalues. Let us consider Complex Characteristic Function:
All nonconstant eigenvalues (which depend on the parameter γ) are γ-points of (Complex-Real) Characteristic Function (CF)[7]. CF γ(q) is the restriction of Complex CF γc(q) on a set Dξ := {q ∈ Im γc(q) = 0}. A set Eξ(γ0) := γ−1(γ0) is the set of all nonconstant eigenvalue points for γ0 ∈ R. If q ∈ Dξ and γc′ (q) ̸= 0 (q is not a Critical Point (CP) of CF), then Eξ(γ) is smooth parametric curve N : R → Ch locally and we can add arrow on this curve (arrows show the direction in which γ R is increasing). We call such curves regular Spectrum Curves [2]. The regular Spectrum Curves form Spectrum Domain in ∪ {∞} (see Figure 1).
Each regular Spectrum Curve begins at the pole point (γ = −∞) of CF and ends at the pole point (γ = +∞) of CF. We denote a set Poles where np is the number of poles at Ch. For our problems P ⊂ ∪ {0} and all poles are of the first order (we write deg+(p) = 1, p ∈ P).
Two or more Spectrum Curves may intersect at CP. We denote a set , where nb is the number of CPs at . The number of CPs at and we denote as ncr and n+ , respectively. Note that the part of the spectrum domain in set is symmetric to the part in set . then deg+(b) is one unit larger than the order of CP b.
The pole at q = ∞ is of
order. For (31) BC (κ = 1) in the case n = m + 1 the point q = ∞ is CP of the first order. So, A number of all CPs is
For poles and corresponds to the number of outgoing Spectrum Curves at that point. Note that incoming Spectrum Curves alternate with outgoing, so deg+(q) = deg−(q).
2 Graphs. Euler’s characteristic. Digraphs
A graph is a pair of sets G = (V, E) that consists of a non-empty set of vertices (nodes or points), and a set of edges . We say that and vi1 (or vi2 ) is the end of an edge ej. The powers of sets V and E are and The faces of a planar graph are the areas which are surrounded by edges. We denote f the number of such faces.
The Euler’s characteristic χ of a subdivision of a surface is χ = v e + f . Since spectrum curves are on Riemann’s sphere , we are interested in Euler’s characteristic of a sphere S2. Euler’s characteristics of a plane [4] of and a sphere [3] are χ = 2.
In graph theory, a directed graph or digraph is a graph that is made up of a set of points connected by arrows (edges with direction). For a vertex, the number of head ends adjacent to a vertex is called the indegree of the vertex and the number of tail ends adjacent to a vertex is its outdegree. Let G = (V, A) and v ∈ V . The indegree of v is denoted deg−(v) and its outdegree is denoted deg+(v). If for every verte x v ∈ V , deg+(v) = deg−(v), the graph is called a balanced digraph. Simple digraphs have no loops and no multiple arrows with same source and target points. The degree sum formula states that, for a digraph,
The ordered pair is called weakly connected if an undirected path leads from v1 to v2 after replacing all of its directed arrows with undirected edges.
3 Relations between dSLP and graphs properties
It is possible to define relations between properties of dSLP and graph theory. Poles or CPs refer to vertices of a certain graph and parts of Spectrum Curves could be interpreted as edges. In our case, we have a simple balanced weakly connected digraph.
3.1 Properties of Spectrum Curves
Poles, CPs, regular and nonregular Spectrum Curves, CEPs were found by K. Bingele˙ [1].
There is n -1 Spectrum Curves for every n ∈ N, n > 2. Nonregular Spectrum Curves are CEPs and belong to The number of such Spectrum Curves is equal to
Number of regular Spectrum Curves nnce = n − 1 − nce. The poles of CF belong to ∪ {0} ∪ {∞} and np + n∞ = nnce. So, we have formula
Let us denote
Let nc is the number of Spectrum Curves parts in between two CP (including q = ∞ for n = m + 1).
3.2 Spectrum domain as a graph
We consider Spectrum domain as graph on sphere (Riemann sphere ) because . The poles and CPs of the CF are the vertices of this graph. The point ∞ is the pole or CP.
Lemma 1. The number of vertices is
From (7) we have . = Σ….
Lemma 2. The number of edges is
Lemma 3. The number of faces is
This lemma is valid for . Each part of spectrum curve between two increases the number of faces by one. So, this formula is valid for the case Each additional CP b ∈ increases the number of faces by 2(deg+(b) − 1) and number parts of Spectrum Curves between this CP and other CPs by 2 deg+(b).
Numbers of spectrum vertices, edges and faces, expressed by the formulas above, inserted to the Euler’s characteristic’s formula of sphere v - e + f = 2 give new relation.
Theorem 1. The Euler’s characteristic’s formula is equivalent to
This formula was derived in [1] when there are no CPs in all CPs are of the first order and nc = 0 in the case a), c). Then it can be rewritten as
Corollary 1. The number of edges is
Remark 1. In the case m + 1 < n the formulas (10), (12)–(14) are
where nce is defined by (8).
In the case m + 1 = n we have n∞ = 1 κ and np = n 2 + δ, where δ = 1 for the case d) and for n ∈ No in the case b), else δ = 0. So, for m + 1 = n the following formulas
are valid.
Remark 2. then shows that there exist CPs in of the second or the higher order.
References
[1] K. Bingele˙. Investigation of Spectrum for a Sturm–Liouville problem with Two-Point Nonlocal Boundary Conditions. PhD thesis, Vilniaus Universitetas, 2019.
[2] K. Bingele˙, A. Bankauskiene˙, A. Štikonas. Spectrum curves for a discrete Sturm– Liouville problem with one integral boundary condition. Nonlinear Anal. Model. Control, 24(5):755–774, 2019. https://doi.org/10.15388/NA.2019.5.5.
[3] Peter Hilton, Jean Pedersen. The Euler characteristic and Polya’s dream. American Mathematical Monthly, 103, 02 1996. https://doi.org/10.2307/2975104.
[4] E. Manstavičius. Analizine˙ ir tikimybine˙ kombinatorika. TEV, Vilnius, 2007.
[5] M. Sapagovas. Diferencialiniu˛ lygčiu˛ kraštiniai uždaviniai su nelokaliosiomis sąlygomis. Mokslo aidai, Vilnius, 2007.
[6] A. Skučaite˙. Investigation of the spectrum for Sturm–Liouville problem with a nonlocal integral boundary condition. PhD thesis, Vilnius University, 2016.
[7] A. Štikonas, O. Štikoniene˙. Characteristic functions for Sturm–Liouville prob- lems with nonlocal boundary conditions. Math. Model. Anal., 14(2):229–246, 2009. https://doi.org/10.3846/1392-6292.2009.14.229-246.