Results 111 to 120 of about 8,914 (221)
Existence of acyclic matching and Morse complex on transitive digraphs
AKCE International Journal of Graphs and CombinatoricsFor any digraph, there exists a transitive closure. The transitive digraph is a discrete geometric object which has a close relationship with simplicial complex.
Chong Wang, Shiquan Ren
doaj +1 more source
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
Journal of Graph Theory, Volume 113, Issue 1, Page 143-164, September 2026.ABSTRACT Given a graph G, we say that an orientation D of G is a KT orientation if, for all u , v ∈ V ( D ), there is at most one directed path (in any direction) between u and v. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as counterexamples to various ...
Barbora Dohnalová +3 more
wiley +1 more source
On Arc Connectivity of Direct-Product Digraphs
Journal of Applied Mathematics, 2012 Four natural orientations of the direct product of two digraphs are introduced in this paper. Sufficient and necessary conditions for these orientations to be strongly connected are presented, as well as an explicit expression of the arc connectivity of ...
Tiedan Zhu, Jianping Ou
doaj +1 more source
The superposition method for the reconstruction of food webs
Methods in Ecology and Evolution, Volume 17, Issue 9, Page 2770-2782, September 2026.Abstract Understanding trophic positions is essential for analysing complex food webs. While calculating these positions can be straightforward when feeding relationships and their proportions are known, determining diet coefficients traditionally requires substantial time and effort.
Ettore Barbieri, Naoto F. Ishikawa
wiley +1 more source
Novel Applications of Intuitionistic Fuzzy Digraphs in Decision Support Systems
The Scientific World Journal, 2014 Many problems of practical interest can be modeled and solved by using graph algorithms. In general, graph theory has a wide range of applications in diverse fields.
Muhammad Akram +2 more
doaj +1 more source
Spanish‐Speaking Secondary Students Reading and Spelling in English as a Foreign Language
European Journal of Education, Volume 61, Issue 3, September 2026.ABSTRACT Proficiency in English reading and spelling is essential, as many professional environments require both spoken and written skills. Literacy development in English as a foreign language poses challenges for learners whose first language is transparent, such as Spanish, due to the complexity and inconsistency of English orthography.
Paz Suárez‐Coalla +3 more
wiley +1 more source
Studies in Applied Mathematics, Volume 157, Issue 3, September 2026.ABSTRACT We show that the removal of a type of reverse reactions preserves the absence of Hopf bifurcations in mass‐action reaction networks, or more precisely, the absence of single pairs of purely imaginary eigenvalues of the Jacobian of the system. The motivation is to answer the open question of whether the dual phosphorylation mechanism requiring ...
Elisenda Feliu, Nidhi Kaihnsa
wiley +1 more source
From subKautz digraphs to cyclic Kautz digraphs [PDF]
, 2017 Kautz digraphs K(d,l) are a well-known family of dense digraphs, widely studied as a good model for interconnection networks. Closely related with these, the cyclic Kautz digraphs CK(d,l) were recently introduced by Böhmová, Huemer and the author, and ...
Dalfó Simó, Cristina
core
Mixed Qualitative/Quantitative Dynamic Simulation of Processing Systems [PDF]
Iranian Journal of Chemistry & Chemical Engineering, 2005 In this article the methodology proposed by Li and Wang for mixed qualitative and quantitative modeling and simulation of temporal behavior of processing unit is reexamined and extended to more complex case. The main issue of their approach considers the
Shadi Yadegar, Mahmoud Reza Pishvaie
doaj
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