Abstract: In this paper, relations between discrete Sturm–Liouville problem with nonlo- cal integral boundary condition characteristics (poles, critical points, spectrum curves) and graphs characteristics (vertices, edges and faces) were found. The previous article was de- voted to the Sturm–Liouville problem in the case two-points nonlocal boundary conditions.
Keywords: Sturm–Liouville problem, spectrum curves, integral boundary condition, graphs.
Summary: Šiame straipsnyje pristatomos sąsajos tarp diskrečiojo Šturmo ir Liuvilio uždavinio su nelokaliąja integraline kraštine sąlyga (poliai, kritiniai taškai ir spektrine˙s kreive˙s) bei grafu˛ charakteristiku˛ (viršu¯ne˙s, briaunos ir veidai). Ankstesnis straipsnis buvo skirtas Sturmo ir Liuvilio uždaviniui su dvitaške˙mis nelokaliosiomis kraštine˙mis sąlygomis.
Keywords: Šturmo ir Liuvilio uždavinys, spektrine˙s kreive˙s, integraline˙ kraštine˙ sąlyga, grafai.
Articles
Relations between Spectrum Curves of Discrete Sturm-Liouville Problem with Nonlocal Boundary Conditions and Graph Theory. II
Diskrečiojo Šturmo ir Liuvilio uždavinio su nelokaliosiomis kraštine˙mis sąlygomis spektriniu˛ kreiviu˛ ir grafu˛ teorijos sąsajos. II
Recepción: 23 Julio 2021
Publicación: 01 Diciembre 2021
In this paper, particular properties of the spectrum of a discrete Sturm–Liouville Problem (dSLP) [3, 4, 5] with Integral Boundary Condition were found using Euler’s charakteristic formula [2]. In previous article [5] we have found relations between spec- trum curve properties and graphs theory in the case of two-points nonlocal boundary conditions.
We introduce a uniform grid and we use notation for and Also ,we make an assumption that and are located on the qrid Let here We denote
Let us consider a dSLP (an approximation by Finite-Difference Scheme) [3, 5]
with a classical discrete Dirichlet Boundary Condition (BC)
and Integral Boundary Condition (approximated by trapezoidal formula):
Let us consider a bijection (see [1])
between and
The general solution Uj for a discrete equation (1) is equal to:
Then by using BCs (2) and (3) we get an equation:
where functions and are as follows:
Constant Eigenvalues. For any constant eigenvalue there exists theConstant Eigenvalue Point (CEP) . CEP are roots of the system [1]:
For every CEP we define nonregular Spectrum Curve
Nonconstant eigenvalues. Let us consider Complex Characteristic Function:
All nonconstant eigenvalues (which depend on the parameter ) are -points of (Complex-Real) Characteristic Function (CF)[6]. CF (q) is the restriction of Com- plex CF (q) on a set Im (see more in [5]). We call such
There exist Pole Points (PP) of the second order. They are described as follows:
All PP of the second order are in . Note that there could be a PP of second order in Ramification Point, so they become simple PP of the first order.
Two or more Spectrum Curves may intersect at CP. We denote a set , where is the number of CPs at The number of CPs at and we denote as,and , respectively. Note that the part of the spectrumdomain in set is symmetric to the part in set . So, If then is one unit larger than the order of this CP.
The pole at is of
order. If is a PP. For is a Removable Singularity Point.
For poles and CP corresponds to the number of outgoing Spectrum Curves at that point. Note that incoming Spectrum Curves alternate with outgoing, so
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. Definitions and notations in graphs theory are described in [5].
Poles, CPs, regular and nonregular Spectrum Curves, CEPs were found by A. Skučaite˙ [4].
There is Spectrum Curves for everyNonregular Spectrum Curves are CEPs and belong to . The number of such Spectrum Curves is equal to
Number of regular Spectrum Curves . The poles of CF belong to and So, we have formula
Let us denote
Let is the number of Spectrum Curves parts in between two CP (including and ).
We consider Spectrum domain as graph on sphere (Riemann sphere C¯ ) because Ch S2. 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
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 CPs increases the number of faces by one. So, this formula is valid for the case . Each additional CP increases the number of faces by 2()and number parts of Spectrum Curves between this CP and other CPs by .
Numbers of spectrum vertices, edges and faces, expressed by the formulas above, inserted to the Euler’s characteristic’s formula of sphere give new relation.
Theorem 1. The Euler’s characteristic’s formula is equivalent to
This formula was derived in [4] when are not CPs in ,all CPs are of the first order and .Then it can be rewritten as
Corollary 1. The number of edges is
Remark 1. In the case m2 < n the formulas (9)–(13) are
where nce is defined by (7).
In the case we have and (see [4]). In this case we getand . Thus, for are valid. Note, that in this case we have Cycle digraph the following formulas
are valid .Note ,that in this cas we have Cycle digraph
Remark 2. If then shows that there are exist CPs in of the second or the higher order.