Results 1 to 10 of about 48,688 (228)
Bounds for the skew Laplacian (skew adjacency) spectral radius of a digraph [PDF]
Transactions on Combinatorics, 2019 For a simple connected graph $G$ with $n$ vertices and $m$ edges, let $\overrightarrow{G}$ be a digraph obtained by giving an arbitrary direction to the edges of $G$.
Hilal A. Ganie
doaj +2 more sources
Knowledge Graph Reasoning with Relational Digraph [PDF]
The Web Conference, 2021 Reasoning on the knowledge graph (KG) aims to infer new facts from existing ones. Methods based on the relational path have shown strong, interpretable, and transferable reasoning ability.
Yongqi Zhang, Quanming Yao
semanticscholar +1 more source
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
Digraph Signal Processing With Generalized Boundary Conditions [PDF]
IEEE Transactions on Signal Processing, 2020 Signal processing on directed graphs (digraphs) is problematic, since the graph shift, and thus associated filters, are in general not diagonalizable. Furthermore, the Fourier transform in this case is now obtained from the Jordan decomposition, which ...
B. Seifert, Markus Püschel
semanticscholar +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
Digraph Coloring and Distance to Acyclicity [PDF]
Theory of Computing Systems, 2020 In k-Digraph Coloring we are given a digraph and are asked to partition its vertices into at most k sets, so that each set induces a DAG. This well-known problem is NP-hard, as it generalizes (undirected) k-Coloring, but becomes trivial if the input ...
Ararat Harutyunyan +2 more
semanticscholar +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