Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
On Characteristic Polynomial of Antiadjacency Matrix of A Line Digraph
View through CrossRef
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 finding the connection between the antiadjacency matrix of a digraph and its line digraph. In this paper, we show the connection of characteristic polynomial of the antiadjacency matrix between an acyclic digraph and its line digraph.
Universitas Andalas
Title: On Characteristic Polynomial of Antiadjacency Matrix of A Line Digraph
Description:
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 finding the connection between the antiadjacency matrix of a digraph and its line digraph.
In this paper, we show the connection of characteristic polynomial of the antiadjacency matrix between an acyclic digraph and its line digraph.
Related Results
ON ANTIADJACENCY MATRIX OF A DIGRAPH WITH DIRECTED DIGON(S)
ON ANTIADJACENCY MATRIX OF A DIGRAPH WITH DIRECTED DIGON(S)
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 digrap...
Exact and Approximate Digraph Bandwidth
Exact and Approximate Digraph Bandwidth
Abstract
In this paper, we introduce a directed variant of the classical Bandwidthproblem and study it from the view-point of moderately exponential time algorithms, both...
Exact and Approximate Digraph Bandwidth
Exact and Approximate Digraph Bandwidth
Abstract
Note: Please see pdf for full abstract with equations.
In this paper, we introduce a directed variant of the classical BANDWIDTH problem and study it from the view...
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
On isomorphisms of m-Cayley digraphs
On isomorphisms of m-Cayley digraphs
The isomorphism problem for digraphs is a fundamental problem in graph theory. This problem for Cayley digraphs has been extensively investigated over the last half a century. In t...
Akar-akar Polinomial Separable sebagai Pembentuk Perluasan Normal pada Ring Modulo
Akar-akar Polinomial Separable sebagai Pembentuk Perluasan Normal pada Ring Modulo
One of the most important uses of the ring and field theory is an extension of a broader field so that a polynomial can be found to have roots. In this study researchers took modul...
Linearization schemes for Hermite matrix polynomials
Linearization schemes for Hermite matrix polynomials
The polynomial eigenvalue problem is to find the eigenpair of $(\lambda,x) \in \mathbb{C}\bigcup \{\infty\} \times \mathbb{C}^n \backslash \{0\}$ that satisfies $P(\lambda)x=0$, wh...
A Polynomial Kernel for Funnel Arc Deletion Set
A Polynomial Kernel for Funnel Arc Deletion Set
AbstractIn Directed Feedback Arc Set (DFAS) we search for a set of at most k arcs which intersect every cycle in the input digraph. It is a well-known open problem in parameterized...