Results 1 to 10 of about 1,150 (71)
Kings in quasi-transitive digraphs
Discrete Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bang-Jensen, Jørgen, Huang, Jing
core +9 more sources
Restricted domination in Quasi-transitive and 3-Quasi-transitive digraphs
Discrete Applied Mathematics, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marco Antonio López-Ortiz +1 more
exaly +8 more sources
Solving the kernel perfect problem by (simple) forbidden subdigraphs for digraphs in some families of generalized tournaments and generalized bipartite tournaments [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A digraph such that every proper induced subdigraph has a kernel is said to be \emph{kernel perfect} (KP for short) (\emph{critical kernel imperfect} (CKI for short) resp.) if the digraph has a kernel (does not have a kernel resp.).
H. Galeana-Sánchez, M. Olsen
doaj +3 more sources
H-Kernels in Unions of H-Colored Quasi-Transitive Digraphs
Discussiones Mathematicae Graph Theory, 2021 Let H be a digraph (possibly with loops) and D a digraph without loops whose arcs are colored with the vertices of H (D is said to be an H-colored digraph). For an arc (x, y) of D, its color is denoted by c(x, y). A directed path W = (v0, . .
Campero-Alonzo José Manuel +1 more
doaj +2 more sources
Cayley bipolar fuzzy graphs. [PDF]
ScientificWorldJournal, 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.
Alshehri NO, Akram M.
europepmc +2 more sources
Hamiltonian Cycle Problem in Strong k-Quasi-Transitive Digraphs With Large Diameter
Discussiones Mathematicae Graph Theory, 2021 Let k be an integer with k ≥ 2. A digraph is k-quasi-transitive, if for any path x0x1... xk of length k, x0 and xk are adjacent. Let D be a strong k-quasi-transitive digraph with even k ≥ 4 and diameter at least k +2.
Wang Ruixia
doaj +2 more sources
Chordality of locally semicomplete and weakly quasi-transitive digraphs [PDF]
Discrete Mathematics, 2021 Chordal graphs are important in the structural and algorithmic graph theory. A digraph analogue of chordal graphs was introduced by Haskin and Rose in 1973 but has not been a subject of active studies until recently when a characterization of semicomplete chordal digraphs in terms of forbidden subdigraphs was found by Meister and Telle.
Jing Huang, Ying Ying Ye
openaire +4 more sources
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
Dual digraphs of finite semidistributive lattices
Cubo, 2022 Dual digraphs of finite join-semidistributive lattices, meet-semidistributive lattices and semidistributive lattices are characterised. The vertices of the dual digraphs are maximal disjoint filter-ideal pairs of the lattice.
Andrew Craig +2 more
doaj +1 more source