Preorder Construct on Simple Undirected Graphs

arXiv1703.03290MaRDI QIDQ6284129FDOQ6284129

João Xavier, José M. F. Moura, Augusto Almeida Santos

Publication date: 9 March 2017

Abstract: We construct a novel preorder on the set of nodes of a simple undirected graph. We prove that the preorder (induced by the topology of the graph) is preserved, e.g., by the logistic dynamical system (both in discrete and continuous time). Moreover, the underlying equivalence relation of the preorder corresponds to the coarsest equitable partition (CEP). This will further imply that the logistic dynamical system on a graph preserves its coarsest equitable partition. The results provide a nontrivial invariant set for the logistic and the like dynamical systems, as we show. We note that our construct provides a functional characterization for the CEP as an alternative to the pure set theoretical iterated degree sequences characterization. The construct and results presented might have independent interest for analysis on graphs or qualitative analysis of dynamical systems over networks.

This page was built for publication: Preorder Construct on Simple Undirected Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6284129)