Results 61 to 70 of about 28,427 (196)
Eulerian digraphs and toric Calabi-Yau varieties
, 2010 We investigate the structure of a simple class of affine toric Calabi-Yau varieties that are defined from quiver representations based on finite eulerian directed graphs (digraphs). The vanishing first Chern class of these varieties just follows from the
de Medeiros, Paul
core +1 more source
Properly Colored Cycles in Edge‐Colored Balanced Bipartite Graphs
Journal of Graph Theory, Volume 112, Issue 2, Page 37-53, June 2026.ABSTRACT Let G n , n c denote a (not necessarily properly) edge‐colored balanced bipartite graph on 2 n vertices, that is, in which every edge is assigned a color. A cycle C in G n , n c is called properly colored if any two consecutive edges of C have distinct colors.
Tingting Han +3 more
wiley +1 more source
On Single Valued Neutrosophic Signed Digraph and its applications [PDF]
Neutrosophic Sets and Systems, 2018 The development of the theory of the single valued neutrosophic (SVN) digraph is done in this paper. Also this paper introduces the concept of SVN signed digraph.
K. Sinha, P. Majumdar
doaj +1 more source
Dyslexia, Volume 32, Issue 2, May 2026.ABSTRACT Growing evidence indicates that people with dyslexia have executive function deficits. The current study used a random generation task as a novel way to investigate executive function in adults with dyslexia. Participants (total N = 54) were asked to produce an unpredictable sequence of 100 digits verbally.
Emmanuella Joy Osofisan +2 more
wiley +1 more source
Frucht’s Theorem for the Digraph Factorial
Discussiones Mathematicae Graph Theory, 2013 To every graph (or digraph) A, there is an associated automorphism group Aut(A). Frucht’s theorem asserts the converse association; that for any finite group G there is a graph (or digraph) A for which Aut(A) ∼= G.
Hammack Richard H.
doaj +1 more source
Domination in Fuzzy Directed Graphs
Mathematics, 2021 A new domination parameter in a fuzzy digraph is proposed to espouse a contribution in the domain of domination in a fuzzy graph and a directed graph. Let GD*=V,A be a directed simple graph, where V is a finite nonempty set and A=x,y:x,y∈V,x≠y.
Enrico Enriquez +4 more
doaj +1 more source
Subsquares in Random Latin Squares and Rectangles
Journal of Combinatorial Designs, Volume 34, Issue 4, Page 184-197, April 2026.ABSTRACT A k × n partial Latin rectangle is C ‐ sparse if the number of nonempty entries in each row and column is at most C and each symbol is used at most C times. We prove that the probability a uniformly random k × n Latin rectangle, where k < ( 1 ∕ 2 − α ) n, contains a β n‐sparse partial Latin rectangle with ℓ nonempty entries is 1 ± ε n ℓ for ...
Alexander Divoux +3 more
wiley +1 more source
Discussiones Mathematicae Graph Theory, 2018 A digraph is called irregular if its distinct vertices have distinct degree pairs. An irregular digraph is called minimal (maximal) if the removal of any arc (addition of any new arc) results in a non-irregular digraph. It is easily seen that the minimum
Górska Joanna +4 more
doaj +1 more source
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
Journal of Combinatorial Mathematics and Combinatorial ComputingA ( 0 , 1 ) -labeling of a set is said to be friendly if the number of elements of the set labeled 0 and the number labeled 1 differ by at most 1. Let g be a labeling of the edge set of a graph that is induced by a labeling f of the vertex set. If both g and f are friendly then g is said to be a cordial labeling of the graph.
openaire +2 more sources