Results 21 to 30 of about 1,150 (71)
Underlying Graphs of 3-Quasi-Transitive Digraphs and 3-Transitive Digraphs
Discussiones Mathematicae Graph Theory, 2013 A digraph is 3-quasi-transitive (resp. 3-transitive), if for any path x0x1 x2x3 of length 3, x0 and x3 are adjacent (resp. x0 dominates x3). C´esar Hern´andez-Cruz conjectured that if D is a 3-quasi-transitive digraph, then the underlying graph of D, UG ...
Wang Ruixia, Wang Shiying
doaj +1 more source
k‐quasi‐transitive digraphs of large diameter
Journal of Graph Theory, 2017 AbstractGiven an integer with , a digraph is ‐quasi‐transitive if for every ‐directed path of length in , we have or (or both). In this study, we prove that if is an odd integer, , then every strong ‐quasi‐transitive digraph of diameter at least admits a partition of its vertex set such that is Hamiltonian, and both and are semicomplete ...
Jesús Alva‐Samos +1 more
openaire +2 more sources
4-Transitive Digraphs I: The Structure of Strong 4-Transitive Digraphs
Discussiones Mathematicae Graph Theory, 2013 Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A digraph D is transitive if for every three distinct vertices u, v,w ∈ V (D), (u, v), (v,w) ∈ A(D) implies that (u,w) ∈ A(D).
Hernández-Cruz César
doaj +1 more source
Some Remarks On The Structure Of Strong K-Transitive Digraphs
Discussiones Mathematicae Graph Theory, 2014 A digraph D is k-transitive if the existence of a directed path (v0, v1, . . . , vk), of length k implies that (v0, vk) ∈ A(D). Clearly, a 2-transitive digraph is a transitive digraph in the usual sense.
Hernández-Cruz César +1 more
doaj +1 more source
, 2015 This is an Open Access article, first published by E-CJ on 25 February 2015.We study digraphs preserved by a Maltsev operation: Maltsev digraphs. We show that these digraphs retract either onto a directed path or to the disjoint union of directed cycles,
Carvalho, Catarina +3 more
core +1 more source
Vertices with the Second Neighborhood Property in Eulerian Digraphs
, 2019 The Second Neighborhood Conjecture states that every simple digraph has a vertex whose second out-neighborhood is at least as large as its first out-neighborhood, i.e. a vertex with the Second Neighborhood Property.
Cary, Michael
core +4 more sources
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
Vertex heaviest paths and cycles in quasi-transitive digraphs
Discrete Mathematics, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gutin, Gregory, Bang-Jensen, J.
openaire +11 more sources
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