Results 111 to 120 of about 34,890 (227)

Convergence of iterative algorithm for G-nonexpansive mapping with digraph: application on G-variational inequality problem and signal recovery

open access: yesApplied Mathematics in Science and Engineering
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

Species on Digraphs

open access: yesAdvances in Mathematics, 1996
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]

open access: green, 2013
Qingqiong Cai, Xueliang Li, Jiangli Song
openalex   +1 more source

Finite-dimensional flexible algebras associated with directed and weighted CW complexes

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica
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

Digraphs and cycle polynomials for free-by-cyclic groups [PDF]

open access: green, 2013
Yael Algom-Kfir   +2 more
openalex   +1 more source

Digraph homomorphisms on $Z_n$-digraph

open access: yesMalaya Journal of Matematik, 2020
Jimly Manuel, Bindhu K Thomas
openaire   +1 more source

Home - About - Disclaimer - Privacy