Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
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.
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

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...
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 Study on Network Graph-PW, Network Symmetric Digraph-PW, Change Network Graph-PW and Change Network Symmetric Digraph- PW
A Study on Network Graph-PW, Network Symmetric Digraph-PW, Change Network Graph-PW and Change Network Symmetric Digraph- PW
Networks play an important role in electrical and electronic engineering. It depends on what area of electrical and electronic engineering, for example, there is a lot more abstrac...
α-diperfect digraphs
α-diperfect digraphs
Let D be a digraph. A path partition P of D is a collection of paths such that {V(P) : P ∈ P} is a partition of V(D). We say D is α-diperfect if for every maximum stable set S of D...
Distributed matrix computing system for big data
Distributed matrix computing system for big data
In order to solve the problem of low computing efficiency in big data analysis and model construction, this paper intended to deeply explore the big data analysis programming model...
A tissue engineering approach to trabecular bone replacement
A tissue engineering approach to trabecular bone replacement
Due to the limitations of current bone graft materials, tissue engineers have looked to develop a synthetic alternative to trabecular bone. This thesis has examined the development...

Back to Top