Results 1 to 10 of about 34,455 (233)
Enumeration of cyclic vertices and components over the congruence a¹¹ ≡ b (mod n) [PDF]
Notes on Number Theory and Discrete Mathematics, 2023 For each positive integer n, we assign a digraph Γ(n,11) whose set of vertices is Zₙ={0,1,2,...,n-1} and there exists exactly one directed edge from the vertex a to the vertex b iff a¹¹ ≡ b (mod n).
Sanjay Kumar Thakur +2 more
doaj +1 more source
The majority coloring of the join and Cartesian product of some digraph [PDF]
MATEC Web of Conferences, 2022 A majority coloring of a digraph is a vertex coloring such that for every vertex, the number of vertices with the same color in the out-neighborhood does not exceed half of its out-degree.
Shi Mei +3 more
doaj +1 more source
ON ANTIADJACENCY MATRIX OF A DIGRAPH WITH DIRECTED DIGON(S)
Barekeng, 2022 The antiadjacency matrix is one representation matrix of a digraph. In this paper, we find the determinant and the characteristic polynomial of the antiadjacency matrix of a digraph with directed digon(s).
Muhammad Irfan Arsyad Prayitno +1 more
doaj +1 more source
On Characteristic Polynomial of Antiadjacency Matrix of A Line Digraph
Jurnal Matematika UNAND, 2022 In this paper, we find the characteristic polynomial of the antiadjacency matrix of a line digraph. There are recent studies on the relation between the characteristic polynomial of the adjacency matrix and its line digraph, we are also interested in ...
Muhammad Irfan Arsyad Prayitno +1 more
doaj +1 more source
Kernel perfect and critical kernel imperfect digraphs structure [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A kernel $N$ of a digraph $D$ is an independent set of vertices of $D$ such that for every $w \in V(D)-N$ there exists an arc from $w$ to $N$. If every induced subdigraph of $D$ has a kernel, $D$ is said to be a kernel perfect digraph. Minimal non-kernel
Hortensia Galeana-Sánchez +1 more
doaj +1 more source
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
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
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
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