Results 11 to 20 of about 20,401 (60)
We present iterative approximation results of an iterative scheme for finding common fixed points of edge‐preserving quasi‐nonexpansive self‐maps in Hilbert spaces along with directed graph. We obtain weak as well as strong convergence of our scheme under various assumptions.
Kiran Dewangan +5 more
wiley +1 more source
Seymour’s Second Neighborhood Conjecture for m‐Free Oriented Graphs
Let (D = (V, E)) be an oriented graph with minimum out‐degree δ+. For x ∈ V(D), let dD+x and dD++x be the out‐degree and second out‐degree of x in D, respectively. For a directed graph D, we say that a vertex x ∈ V(D) is a Seymour vertex if dD++x≥dD+x. Seymour in 1990 conjectured that each oriented graph has a Seymour vertex.
Huawen Ma, Ganesh Ghorai
wiley +1 more source
Decomposing tournaments into paths
Abstract We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from 1976. Kelly's conjecture states that every regular tournament has an edge decomposition into Hamilton cycles, and this was proved by Kühn and Osthus for large tournaments. The conjecture of Alspach, Mason, and Pullman asks for the minimum number
Allan Lo +3 more
wiley +1 more source
Research on Extreme Signed Graphs with Minimal Energy in Tricyclic Signed Graphs S(n, n + 2)
A signed graph is acquired by attaching a sign to each edge of a simple graph, and the signed graphs have been widely used as significant computer models in the study of complex systems. The energy of a signed graph S can be described as the sum of the absolute values of its eigenvalues.
Yajing Wang +2 more
wiley +1 more source
Caristi‐Type Fixed Point Theorem over Száz Principle in Quasi‐Metric Space with a Graph
The aim of this paper is to generalize Caristi’s fixed point theorem in a K‐complete quasi‐metric space endowed with a reflexive digraph by using Száz maximum principle. An example is given to support our main result.
Karim Chaira +4 more
wiley +1 more source
CREDIBLY IDENTIFYING SOCIAL EFFECTS: ACCOUNTING FOR NETWORK FORMATION AND MEASUREMENT ERROR
Abstract Understanding whether and how connections between agents (networks) such as declared friendships in classrooms, transactions between firms, and extended family connections, influence their socio‐economic outcomes has been a growing area of research within economics. Early methods developed to identify these social effects assumed that networks
Arun Advani, Bansi Malde
wiley +1 more source
We introduce the concept of Cayley bipolar fuzzy graphs and investigate some of their properties. We present some interesting properties of bipolar fuzzy graphs in terms of algebraic structures. We also discuss connectedness in Cayley bipolar fuzzy graphs.
Noura O. Alshehri +4 more
wiley +1 more source
Finitely Dependent Insertion Processes
A $q$-coloring of $\mathbb Z$ is a random process assigning one of $q$ colors to each integer in such a way that consecutive integers receive distinct colors. A process is $k$-dependent if any two sets of integers separated by a distance greater than $k$
Levy, Avi
core +1 more source
DAG-width and circumference of digraphs
We prove that every digraph of circumference $l$ has DAG-width at most $l$ and this is best possible. As a consequence of our result we deduce that the $k$-linkage problem is polynomially solvable for every fixed $k$ in the class of digraphs with bounded
Bang-Jensen, Jørgen, Larsen, Tilde My
core +1 more source
Representation of Cyclotomic Fields and Their Subfields [PDF]
Let $\K$ be a finite extension of a characteristic zero field $\F$. We say that the pair of $n\times n$ matrices $(A,B)$ over $\F$ represents $\K$ if $\K \cong \F[A]/$ where $\F[A]$ denotes the smallest subalgebra of $M_n(\F)$ containing $A$ and $$ is an
A. K. Lal +3 more
core

