Sentence examples for a signed graph from inspiring English sources
The coopetition network involves positive and negative edges and is conveniently modeled by a signed graph.
The interactions among the agents are cooperative and competitive simultaneously and thus the interaction network (just called coopetition network in sequel for simplicity) is conveniently modeled by a signed graph.
In this paper, we present a component selection process that uses a signed graph to model interdependencies of CBS-to-be needs and groups related goals into clusters, based on the usage, non-functional and threat dependencies.
The interaction network associated with a multi-agent system is modeled by a signed graph (called coopetition network in sequel) and the dynamics of each agent is described by a high order differential equation with a nonlinear unknown time-varying disturbance.
In spite of the minimal amount of information it contains, a signed graph can already be used to study dynamical systems properties.
We have modified the network in order to obtain an interaction graph, i.e. an oriented signed graph whose arrows (directed edges) represent interactions.
Under the assumptions that all signed graphs are structurally balanced and the nonlinear system satisfies a one-sided Lipschitz condition, we derive conditions under which the network reaches bipartite synchronization for any initial conditions and arbitrary switching signals.
A directed and signed hypergraph is a generalization of a directed and signed graph, where V is the set of nodes and E the set of hyperedges.
In this paper, an interventional consensus problem is formulated mathematically with signed graph theory and dynamical system theory.
In this paper, we study the fixed-time consensus problem for multi-agent systems with structurally balanced signed graph.
The paper designs five graph operations, and proves that every signed graph with chromatic number q, defined by Kang and Steffen (in press), can be obtained from copies of the all-positive complete graph (Kq,+) by repeatedly applying these operations.
