Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
ON ANTIADJACENCY MATRIX OF A DIGRAPH WITH DIRECTED DIGON(S)
View through CrossRef
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). The digraph that we will discuss is a digraph obtained by adding arc(s) in an arborescence path digraph such that it contained directed digon(s), and a digraph obtained by deleting arc(s) in a complete star digraph. We found that the determinant and the coefficient of the characteristic polynomial of the antiadjacency matrix of a digraph obtained by adding arc(s) in an arborescence path digraph such that it contained directed digon(s) is different depending on the location of the directed digon. Meanwhile, the determinant of the antiadjacency matrix of a digraph obtained by deleting arc(s) in the complete star digraph is zero.
Universitas Pattimura
Title: ON ANTIADJACENCY MATRIX OF A DIGRAPH WITH DIRECTED DIGON(S)
Description:
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).
The digraph that we will discuss is a digraph obtained by adding arc(s) in an arborescence path digraph such that it contained directed digon(s), and a digraph obtained by deleting arc(s) in a complete star digraph.
We found that the determinant and the coefficient of the characteristic polynomial of the antiadjacency matrix of a digraph obtained by adding arc(s) in an arborescence path digraph such that it contained directed digon(s) is different depending on the location of the directed digon.
Meanwhile, the determinant of the antiadjacency matrix of a digraph obtained by deleting arc(s) in the complete star digraph is zero.
Related Results
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...
On Characteristic Polynomial of Antiadjacency Matrix of A Line Digraph
On Characteristic Polynomial of Antiadjacency Matrix of A Line Digraph
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 o...
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...
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...
Matrix Subgridding and Its Effects in Dual Porosity Simulators
Matrix Subgridding and Its Effects in Dual Porosity Simulators
Abstract
Naturally fractured reservoirs are found throughout the world and contain significant amounts of oil reserves. The so-called dual porosity model is one o...
Efficiency of Steamflooding in Naturally Fractured Reservoirs
Efficiency of Steamflooding in Naturally Fractured Reservoirs
Abstract
This study aims to identify the effective parameters on matrix heating and recovery, and the efficiencies of these processes while there is a continuous ...
A quasi-cyclic compressed sensing delay estimation algorithm based on progressive edge-growth
A quasi-cyclic compressed sensing delay estimation algorithm based on progressive edge-growth
Time delay estimation (TDE) is a hot research topic in wireless location technology. Compressed sensing (CS) theory has been widely applied to image reconstruction and direction of...
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...