Uniqueness of a solution to a general class of discrete system defined on connected graphs

In this work we prove uniqueness result for an implicit discrete system defined on connected graphs. Our discrete system is motivated from a certain class of spatial segregation of reaction–diffusion equations.

Saved in:
Bibliographic Details
Published in:Nonlinear analysis 2024-02, Vol.239, p.113439, Article 113439
Main Authors: Arakelyan, Avetik, Bozorgnia, Farid
Format: Article
Language:English
Subjects:
Free boundary problems
Graph theory
Reaction–diffusion system
Uniqueness
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this work we prove uniqueness result for an implicit discrete system defined on connected graphs. Our discrete system is motivated from a certain class of spatial segregation of reaction–diffusion equations.
ISSN:0362-546X
1873-5215
DOI:10.1016/j.na.2023.113439