On the disconjugacy property of an equation on a graph (Q299158)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the disconjugacy property of an equation on a graph |
scientific article; zbMATH DE number 6596331
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the disconjugacy property of an equation on a graph |
scientific article; zbMATH DE number 6596331 |
Statements
On the disconjugacy property of an equation on a graph (English)
0 references
22 June 2016
0 references
This paper studies fourth-order ordinary differential equations on geometric graphs. The notion of strong disconjugacy of such an equation is defined, in terms of the nonvanishing of a certain fundamental system of solutions in the interior of the graph. Relations between the strong disconjugacy concept and the positivity of the Green's function are established, as well as a maximum principle, and applications to positivity of solutions of differential inequalities.
0 references
differential equation on a graph
0 references
disconjugacy
0 references
Green's function
0 references
maximum principle
0 references
differential inequality
0 references
0.9467697739601136
0 references
0.9038680195808412
0 references
0.8896152377128601
0 references
0.8650174140930176
0 references
0.8340941667556763
0 references
