Results 91 to 100 of about 48,688 (228)
Tree-average distances on certain phylogenetic networks have their weights uniquely determined
Algorithms for Molecular Biology, 2012 A phylogenetic network N has vertices corresponding to species and arcs corresponding to direct genetic inheritance from the species at the tail to the species at the head.
Willson Stephen J
doaj +1 more source
Tr-Span of Directed Wheel Graphs
Discussiones Mathematicae Graph Theory, 2018 In this paper, we consider T-colorings of directed graphs. In particular, we consider as a T-set the set Tr = {0, 1, 2, . . ., r−1, r+1, . . .}. Exact values and bounds of the Tr-span of directed graphs whose underlying graph is a wheel graph are ...
Besson Marc, Tesman Barry
doaj +1 more source
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
Unordered Love in infinite directed graphs
International Journal of Mathematics and Mathematical Sciences, 1992 A digraph D=(V,A) has the Unordered Love Property (ULP) if any two different vertices have a unique common outneighbor. If both (V,A) and (V,A−1) have the ULP, we say that D has the SDULP.
Peter D. Johnson
doaj +1 more source
Multi-agent consensus with heterogeneous time-varying input and communication delays in digraphs [PDF]
, 2021 Wei Jiang +2 more
openalex +1 more source
Digraphs Structures Corresponding to the Analogue Realisation of Fractional Continuous-Time System [PDF]
, 2017 A. Konrad
openalex +1 more source
Strengthening the directed Brooks' theorem for oriented graphs and consequences on digraph redicolouring [PDF]
, 2023 Lucas Picasarri‐Arrieta
openalex +1 more source
On k-geodetic digraphs with excess one
Electronic Journal of Graph Theory and Applications, 2014 A k-geodetic digraph G is a digraph in which, for every pair of vertices u and v (not necessarily distinct), there is at most one walk of length at most k from u to v. If the diameter of G is k, we say that G is strongly geodetic.
Anita Abildgaard Sillasen
doaj +1 more source
Extremal results on feedback arc sets in digraphs [PDF]
, 2023 Jacob Fox, Zoe Himwich, Nitya Mani
openalex +1 more source