Results 111 to 120 of about 34,890 (227)
The Halpern iteration method is among the most extensively studied approaches in the literature concerning the approximation of fixed points of G-nonexpansive mappings.
Esra Yolaçan
doaj +1 more source
Extremal results on feedback arc sets in digraphs [PDF]
Jacob Fox, Zoe Himwich, Nitya Mani
openalex +1 more source
The author applies the language of Joyal's species to enumeration problems of digraphs using the machinery of coloured species, see, e.g., the author and \textit{O. Nava} [J. Comb. Theory, Ser. A 64, No. 1, 102-129 (1993; Zbl 0787.05095)]. A species over digraphs is defined as a functor from the category of digraphs to the category of finite sets and ...
openaire +2 more sources
New skew Laplacian energy of a simple digraph [PDF]
Qingqiong Cai, Xueliang Li, Jiangli Song
openalex +1 more source
Finite-dimensional flexible algebras associated with directed and weighted CW complexes
In this paper, we study a link between directed and weighted CW complexes (also called configurations) and flexible algebras determining which configurations are associated with those algebras.
Ceballos Manuel
doaj +1 more source
Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs [PDF]
Tamara Mchedlidze, Antonios Symvonis
openalex +1 more source
Even Vertex In-Magic Total Labeling Of Some 2-Regular Digraphs
M. Sindhu, S. Chandra Kumar
openalex +1 more source
Digraphs and cycle polynomials for free-by-cyclic groups [PDF]
Yael Algom-Kfir +2 more
openalex +1 more source
Digraph homomorphisms on $Z_n$-digraph
Jimly Manuel, Bindhu K Thomas
openaire +1 more source

