Results 51 to 60 of about 4,954 (163)
Networks, Volume 86, Issue 3, Page 325-357, October 2025.ABSTRACT The Minimum Path Cover (MPC) problem consists of finding a minimum‐cardinality set of node‐disjoint paths that cover all nodes in a given graph. We explore a variant of the MPC problem on directed acyclic graphs (DAGs) where, given a subset of arcs, each path within the MPC should contain at least one arc from this subset.
Nour ElHouda Tellache, Roberto Baldacci
wiley +1 more source
Generalization of Transitive Cayley Digraphs
Journal of Mathematics Research, 2012 This paper proves several extended theoretical results of transitive Cayley digraphs. Several generalization of transitive Cayley digraphs also have been provided. Moreover, various graph properties have been expressed in terms of algebraic properties. This did not attract much attention in the literature.
Anil Kumar V., Mohanan T.
openaire +2 more sources
Journal of Graph Theory, Volume 110, Issue 1, Page 82-91, September 2025.ABSTRACT An inversion of a tournament T is obtained by reversing the direction of all edges with both endpoints in some set of vertices. Let inv k ( T ) be the minimum length of a sequence of inversions using sets of size at most k that result in the transitive tournament.
Raphael Yuster
wiley +1 more source
Decremental Single-Source Reachability in Planar Digraphs
, 2017 In this paper we show a new algorithm for the decremental single-source reachability problem in directed planar graphs. It processes any sequence of edge deletions in $O(n\log^2{n}\log\log{n})$ total time and explicitly maintains the set of vertices ...
Italiano, Giuseppe F. +3 more
core +2 more sources
A Space-Economic Representation of Transitive Closures in Relational Databases [PDF]
Journal of Systemics, Cybernetics and Informatics, 2006 A composite object represented as a directed graph (digraph for short) is an important data structure that requires efficient support in CAD/CAM, CASE, office systems, software management, web databases, and document databases. It is cumbersome to handle
Yangjun Chen
doaj
The Generic Circular Triangle‐Free Graph
Journal of Graph Theory, Volume 109, Issue 4, Page 426-445, August 2025.ABSTRACT In this article, we introduce the generic circular triangle‐free graph C 3 and propose a finite axiomatization of its first‐order theory. In particular, our main results show that a countable graph G embeds into C 3 if and only if it is a { K 3 , K 1 + 2 K 2 , K 1 + C 5 , C 6 }‐free graph.
Manuel Bodirsky, Santiago Guzmán‐Pro
wiley +1 more source
Super-connected arc-transitive digraphs
Discrete Applied Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Meng, Jixiang, Zhang, Zhao
openaire +1 more source
Infinite arc-transitive and highly-arc-transitive digraphs [PDF]
European Journal of Combinatorics, 2019 A detailed description of the structure of two-ended arc-transitive digraphs is given. It is also shown that several sets of conditions, involving such concepts as Property Z, local quasi-primitivity and prime out-valency, imply that an arc-transitive digraph must be highly-arc-transitive. These are then applied to give a complete classification of two-
Möller, Rögnvaldur G. +2 more
openaire +3 more sources
Nonlinear Almost Contractions via Digraphs and Applications to Boundary Value Problems
IEEE AccessThis paper outlines a few findings that assure the fixed-point of a nonlinear almost contraction employing a transitive and reflexive digraph G. To showcase the profitability of our conclusions, we impart a couple of instances.
Salma Aljawi, Izhar Uddin
doaj +1 more source
On the Terwilliger Algebra of the Group Association Scheme of the Symmetric Group Sym ( 7 )
Journal of Combinatorial Designs, Volume 33, Issue 7, Page 261-274, July 2025.ABSTRACT Terwilliger algebras are finite‐dimensional semisimple algebras that were first introduced by Paul Terwilliger in 1992 in studies of association schemes and distance‐regular graphs. The Terwilliger algebras of the conjugacy class association schemes of the symmetric groups Sym ( n ), for 3 ≤ n ≤ 6, have been studied and completely determined ...
Allen Herman +2 more
wiley +1 more source