Results 31 to 40 of about 16,499 (231)
Operations Research and Decisions, 2016 OPERATIONS RESEARCH AND DECISIONS; ISSN 2081 ...
Peters, Hans +2 more
openaire +8 more sources
Exponential synchronization of the high-dimensional Kuramoto model with identical oscillators under digraphs [PDF]
at - Automatisierungstechnik, 2018 For the Kuramoto model and its variations, it is difficult to analyze the exponential synchronization under the general digraphs due to the lack of symmetry.
Jinxing Zhang, Jiandong Zhu
semanticscholar +1 more source
Journal of Combinatorial Theory, Series B, 2017 An antidirected trail in a digraph is a trail (a walk with no arc repeated) in which the arcs alternate between forward and backward arcs. An antidirected path is an antidirected trail where no vertex is repeated. We show that it is NP-complete to decide whether two vertices $x,y$ in a digraph are connected by an antidirected path, while one can decide
Jørgen Bang-Jensen +3 more
openaire +4 more sources
Asymptotic enumeration of Cayley digraphs [PDF]
Israel Journal of Mathematics, 2018 In this paper we show that almost all Cayley digraphs have automorphism group as small as possible; that is, they are digraphical regular representations (DRRs).
Joy Morris, Pablo Spiga
semanticscholar +1 more source
Journal of Graph Theory, 1980 AbstractFor an integer k > 2, the best function m(n, k) is determined such that every strong digraph of order n with at least m(n, k) arcs contains a circuit of length k or less.
Jean-Claude Bermond +3 more
openaire +2 more sources
Processing Large Outliers in Arrays of Observations
Mathematics, 2022 The interest in large or extreme outliers in arrays of empirical information is caused by the wishes of users (with whom the author worked): specialists in medical and zoo geography, mining, the application of meteorology in fishing tasks, etc.
Gurami Tsitsiashvili
doaj +1 more source
Distributed Convex Optimization with Inequality Constraints over Time-Varying Unbalanced Digraphs [PDF]
IEEE Transactions on Automatic Control, 2016 This paper considers a distributed convex optimization problem with inequality constraints over time-varying unbalanced digraphs, where the cost function is a sum of local objective functions, and each node of the graph only knows its local objective and
Pei Xie +4 more
semanticscholar +1 more source
Infinite digraphs isomorphic with their line digraphs
Journal of Combinatorial Theory, Series B, 1976 In this paper we give a structural characterization of the digraphs that are isomorphic with their line digraphs.
Lowell W. Beineke, Robert L. Hemminger
openaire +1 more source
A Note on the Concept of Time in Extensive Games
Mathematics, 2022 Using the concept of informational digraphs, we propose a “no redundant information sets” property that can characterize the exact class of extensive games which can be time structured. Our result can be applied to define time-dependent solution concepts
Shravan Luckraz, Bruno Antonio Pansera
doaj +1 more source
A line digraph of a complete bipartite digraph
Applied Mathematics Letters, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Juan Liu 0001, Lin Sun, Jixiang Meng
openaire +1 more source