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
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...
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...
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 ...
The Multivariable Zhang–Zhang Polynomial of Phenylenes
The Multivariable Zhang–Zhang Polynomial of Phenylenes
The Zhang–Zhang polynomial of a benzenoid system is a well-known counting polynomial that was introduced in 1996. It was designed to enumerate Clar covers, which are spanning subgr...
A New Alternative to Szeged, Mostar, and PI Polynomials—The SMP Polynomials
A New Alternative to Szeged, Mostar, and PI Polynomials—The SMP Polynomials
Szeged-like topological indices are well-studied distance-based molecular descriptors, which include, for example, the (edge-)Szeged index, the (edge-)Mostar index, and the (vertex...