A graph theoretic approach to strong monotonicity with respect to polyhedral cones

DOI10.1023/A:1015290601993zbMath1079.37015OpenAlexW2171574956MaRDI QIDQ1611285

H. Kunze, David Siegel

Publication date: 21 August 2002

Published in: Positivity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1015290601993

zbMATH Keywords

convex conesgraph theorystrongly monotone floworder preserving flow

Mathematics Subject Classification ID

Monotone systems involving ordinary differential equations (34C12) Monotone flows as dynamical systems (37C65)

Related Items (5)

A graph-theoretic condition for irreducibility of a set of cone preserving matrices ⋮ Graphical methods for analysing feedback in biological networks – A survey ⋮ On comparison systems for ordinary differential equations ⋮ Quadratic optimization over a polyhedral cone ⋮ Monotonicity in chemical reaction systems

This page was built for publication: A graph theoretic approach to strong monotonicity with respect to polyhedral cones