Results 111 to 120 of about 6,654 (223)
Directed graph theory for the analysis of biological regulatory networks
Frontiers in Applied Mathematics and StatisticsSynchronous regulated biological networks are often represented as logical diagrams, where the precise interactions between elements remain obscured. Here, we introduce a novel type of excitation-inhibition graph based on Boolean logic, which we term ...
Martha Takane +8 more
doaj +1 more source
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boland, James +2 more
openaire +3 more sources
Journal of Research of the National Institute of Standards and Technology, 2014 A digraph whose degree sequence has a unique vertex labeled realization is called threshold. In this paper we present several characterizations of threshold digraphs and their degree sequences, and show these characterizations to be equivalent. One of the characterizations is new, and allows for a shorter proof of the equivalence of the two known ...
Brian Cloteaux +3 more
openaire +3 more sources
Circulant digraph isomorphisms [PDF]
, 2016 We determine necessary and sufficient conditions for a Cayley digraph of the cyclic group of order n to have the property that any other Cayley digraph of a cyclic group of order n is isomorphic to the first if and only if an isomorphism between the two ...
Cancela, Elias Damian, Cancela, Elias
core +1 more source
Color digraph dan Cayley color digraph dari grup siklik Zn dengan n bilangan prima [PDF]
, 2009 Misal (G,o) adalah grup, (G,o) dikatakan grup siklik jika dan hanya jika terdapat a ∈ G yang sedemikian hingga setiap elemen dari G dapat dibangkitkan/dibangun oleh a, dengan kata lain setiap elemen dari G dapat dituliskan sebagai perpangkatan dari a ...
Jalil, Abdul
core
Infinite kernel perfect digraphs
AKCE International Journal of Graphs and Combinatorics, 2017 Let be a digraph, possibly infinite, V() and A() will denote the sets of vertices and arcs of , respectively. A subset of V() is said to be a kernel if it is both independent (a vertex in has no successor in ) and absorbing (a vertex not in has a ...
Rocío Sánchez-López
doaj +1 more source
Structural detectability analysis of cyber attacks for power grids via graph theory
IET Cyber-Physical Systems, 2018 Cyber-physical systems are pervasive in every walk of life. The safety performances of these systems are threatened by external malicious attacks and unforeseen failures. In terms of grid structural characteristics and graph theory, this study proposes a
Xiaoyuan Luo +2 more
doaj +1 more source
When the arc-colored line digraph of a cayley colored digraph is again a cayley colored digraph [PDF]
Let D6(G) be the Cayley colored ügraph of a finite group G generated by A. The arc-colored line digraph of a Cayley colored digraph ie obtained by appropriately coloring the arcs of its line digraph.
Fiol Mora, Maria Lluïsa +2 more
core
European Journal of Combinatorics, 2018 In 1995, Stiebitz asked the following question: For any positive integers $s,t$, is there a finite integer $f(s,t)$ such that every digraph $D$ with minimum out-degree at least $f(s,t)$ admits a bipartition $(A, B)$ such that $A$ induces a subdigraph with minimum out-degree at least $s$ and $B$ induces a subdigraph with minimum out-degree at least $t$?
Donglei Yang +3 more
openaire +2 more sources
Isomorphic factorization, the Kronecker product and the line digraph [PDF]
, 2007 In this paper, we investigate isomorphic factorizations of the Kronecker product graphs. Using these relations, it is shown that (1) the Kronecker product of the d-out-regular digraph and the complete symmetric digraph is factorized into the line digraph,
Tanaka, Yuuki +5 more
core +2 more sources