Results 11 to 20 of about 6,654 (223)
A line digraph of a complete bipartite digraph [PDF]
Applied Mathematics Letters, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Juan Liu 0001, Lin Sun, Jixiang Meng
openaire +2 more sources
Frucht’s Theorem for the Digraph Factorial [PDF]
Discussiones Mathematicae Graph Theory, 2013 To every graph (or digraph) A, there is an associated automorphism group Aut(A). Frucht’s theorem asserts the converse association; that for any finite group G there is a graph (or digraph) A for which Aut(A) ∼= G.
Hammack Richard H.
doaj +2 more sources
Discrete Mathematics, 2001 The author studies the problem of upward embedding on the round sphere and gives a characterization of all spherical digraphs.
S.Mehdi Hashemi, Hashemi, S.Mehdi
openaire +3 more sources
H-kernels by walks in an () digraph
AKCE International Journal of Graphs and Combinatorics, 2019 Let be a digraph possibly with loops and a digraph without loops whose arcs are colored with the vertices of ( is said to be an -colored digraph). A directed walk in is said to be an -walk if and only if the consecutive colors encountered on form a ...
Hortensia Galeana-Sánchez +3 more
doaj +2 more sources
$H$-kernels by walks in subdivision digraph [PDF]
Transactions on Combinatorics, 2020 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).
Hortensia Galeana-Sánchez +3 more
doaj +1 more source
Some results on the existence of Hamiltonian cycles in -compositions of bipartite digraphs
AKCE International Journal of Graphs and Combinatorics, 2020 Let D be a digraph on n vertices s1, …, sn and let D1, …, Dn be a family of vertex-disjoint bipartite digraphs. We think of D1, …, Dn as 2-colored digraphs with the same color set.
Pilar Cano +2 more
doaj +1 more source
New Applied Problems in the Theory of Acyclic Digraphs
Mathematics, 2021 The following two optimization problems on acyclic digraph analysis are solved. The first of them consists of determining the minimum (in terms of volume) set of arcs, the removal of which from an acyclic digraph breaks all paths passing through a subset
Gurami Tsitsiashvili, Victor Bulgakov
doaj +1 more source
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 +1 more source
Generalized Neutrosophic Competition Graphs [PDF]
Neutrosophic Sets and Systems, 2020 The generalized neutrosophic graph is a generalization of the neutrosophic graph that represents a system perfectly. In this study, the concept of a neutrosophic digraph, generalized neutrosophic digraph and out-neighbourhood of a vertex of a ...
Kousik Das, Sovan Samanta, Kajal De
doaj +1 more source