Results 11 to 20 of about 1,088 (61)
Journal of Mathematics, Volume 2023, Issue 1, 2023., 2023 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
Mathematical Problems in Engineering, Volume 2022, Issue 1, 2022., 2022 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
Proceedings of the London Mathematical Society, Volume 121, Issue 2, Page 426-461, August 2020., 2020 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)
Complexity, Volume 2020, Issue 1, 2020., 2020 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
Journal of Mathematics, Volume 2019, Issue 1, 2019., 2019 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
Journal of Economic Surveys, Volume 32, Issue 4, Page 1016-1044, September 2018., 2018 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
Amenability and geometry of semigroups [PDF]
, 2017 We study the connection between amenability, Følner conditions and the geometry of finitely generated semigroups. Using results of Klawe, we show that within an extremely broad class of semigroups (encompassing all groups, left cancellative semigroups ...
Gray, Robert, Kambites, Mark
core +1 more source
The Scientific World Journal, Volume 2013, Issue 1, 2013., 2013 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
Hamilton cycles in dense vertex-transitive graphs [PDF]
, 2014 A famous conjecture of Lov\'asz states that every connected vertex-transitive graph contains a Hamilton path. In this article we confirm the conjecture in the case that the graph is dense and sufficiently large.
Alon +28 more
core +2 more sources
Countable locally 2-arc-transitive bipartite graphs [PDF]
, 2014 We present an order-theoretic approach to the study of countably infinite locally 2-arc-transitive bipartite graphs. Our approach is motivated by techniques developed by Warren and others during the study of cycle-free partial orders. We give several new
Biggs +33 more
core +3 more sources