On the disconjugacy property of an equation on a graph


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

Under study is the disconjugacy theory of forth order equations on a geometric graph. The definition of disconjugacy is given in terms of a special fundamental system of solutions to a homogeneous equation. We establish some connections between the disconjugacy property and the positivity of the Green’s functions for several classes of boundary value problems for forth order equation on a graph. We also state the maximum principle for a forth order equation on a graph and prove some properties of differential inequalities.

作者简介

R. Kulaev

Southern Mathematical Institute; Khetagurov North Ossetian State University

编辑信件的主要联系方式.
Email: kulaev@smath.ru
俄罗斯联邦, Vladikavkaz; Vladikavkaz


版权所有 © Pleiades Publishing, Ltd., 2016
##common.cookie##