Results 91 to 100 of about 6,654 (223)
Context‐free graphs and their transition groups
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract Starting from context‐free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their coword problems are context‐free, analyze torsion elements, and realize them as subgroups of the asynchronous rational group.
Daniele D'Angeli +3 more
wiley +1 more source
Halin's Grid Theorem for Digraphs
Journal of Graph Theory, Volume 113, Issue 1, Page 97-112, September 2026.ABSTRACT Halin showed that every thick end of every graph contains an infinite grid. We extend Halin's theorem to digraphs. More precisely, we show that for every infinite family ℛ of disjoint equivalent out‐rays there is a grid whose vertical rays are contained in ℛ
wiley +1 more source
SUPERPURE DIGRAPH DESIGNS [PDF]
, 2000 A digraph design is a decomposition of a complete (symmetric) digraph into copies of pre-specified digraphs. Well-known examples for digraph designs are Mendelsohn designs, directed designs or orthogonal directed covers.
Sven Hartmann
core
DIGRAPH GROUPS AND RELATED GROUPS [PDF]
, 2022 This thesis investigates finite digraph groups and related groups like the generalization of Johnson and Mennicke groups. Cuno and Williams introduced the term "digraph group" for the first time in [9], 2020.
Cihan, Mehmet Sefa
core
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
The Burning Number of Directed Graphs: Bounds and Computational Complexity
Theory and Applications of Graphs, 2020 The burning number of a graph was recently introduced by Bonato et al. Although they mention that the burning number generalizes naturally to directed graphs, no further research on this has been done. Here, we introduce graph burning for directed graphs,
Remie Janssen
doaj +1 more source
On Tight Tree‐Complete Hypergraph Ramsey Numbers
Journal of Graph Theory, Volume 113, Issue 1, Page 88-96, September 2026.ABSTRACT Chvátal showed that for any tree T with k edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1. For r = 3 or 4, we show that, if T is an r‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ). The 3‐uniform result comes from observing a construction of Cooper and Mubayi.
Jiaxi Nie
wiley +1 more source
On a Compromise Social Choice Correspondence [PDF]
This paper analyzes the compromise social choice correspondence derived from the F-value of digraph games.Among other things monotonicity of this correspondence is shownsocial choice;games;t ...
Borm, P.E.M. +3 more
core +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
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