Results 111 to 120 of about 34,455 (233)
Discrete Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
A new sufficient condition for a 2-strong digraph to be Hamiltonian [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn this paper we prove the following new sufficient condition for a digraph to be Hamiltonian: {\it Let $D$ be a 2-strong digraph of order $n\geq 9$. If $n-1$ vertices of $D$ have degrees at least $n+k$ and the remaining vertex has degree at least $n-
Samvel Kh. Darbinyan
doaj +1 more source
Proceedings of the American Mathematical Society, 2016 A majority digraph is a finite simple digraph G = ( V , → ) G=(V,\to ) such that there exist finite sets A v A_v for the vertices v ∈ V v\in V with the following property: u → v
Lai, Tri +2 more
openaire +3 more sources
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
The Double Roman Domatic Number of a Digraph
Discussiones Mathematicae Graph Theory, 2020 A double Roman dominating function on a digraph D with vertex set V (D) is defined in [G. Hao, X. Chen and L. Volkmann, Double Roman domination in digraphs, Bull. Malays. Math. Sci. Soc. (2017).] as a function f : V (D) → {0, 1, 2, 3} having the property
Volkmann Lutz
doaj +1 more source
From expanded digraphs to lifts of voltage digraphs and line digraphs
, 2016 Research of the first two authors is supported by MINECO under project MTM2014-60127-P, and by AGAUR under project 2014SGR1147.
Dalfó, C. +3 more
openaire +3 more sources
International Journal of Applied Mathematics and Computer Science, 2018 In the last two decades, fractional calculus has become a subject of great interest in various areas of physics, biology, economics and other sciences. The idea of such a generalization was mentioned by Leibniz and L’Hospital.
Markowski Konrad Andrzej
doaj +1 more source
An Algorithm for Finding a Minimum Equivalent Graph of a Digraph [PDF]
, 1969 Dennis M. Moyles, Gerald L. Thompson
openalex +1 more source