On the multiplicity of eigenvalues of the Sturm–Liouville problem on graphs

2016

Closed access Metadata (CSL-JSON)
DOI 10.1134/s0001434616030226
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

Bounds for the multiplicity of the eigenvalues of the Sturm–Liouville problem on a graph, which are valid for a wide class of consistency (transmission) conditions at the vertices of the graph, are given. The multiplicities are estimated using the topological characteristics of the graph. In the framework of the notions that we use, the bounds turn out to be exact.