The Adjacency Matrix of One Type of Directed Graph and the Jacobsthal Numbers and Their Determinantal Representation
Recently there is huge interest in graph theory and intensive study on computing integer powers of matrices. In this paper, we consider one type of directed graph. Then we obtain a general form of the adjacency matrices of the graph. By using the well-known property which states the...
Saved in:
Main Authors: | Fatih Yılmaz, Durmuş Bozkurt |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2012-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2012/423163 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the Number of Spanning Trees of Graphs
by: Ş. Burcu Bozkurt, et al.
Published: (2014-01-01) -
The Optimal Graph Whose Least Eigenvalue is Minimal among All Graphs via 1-2 Adjacency Matrix
by: Lubna Gul, et al.
Published: (2021-01-01) -
An introduction of F-graphs, a graph-theoretic representation of natural numbers
by: E. J. Farrell
Published: (1992-01-01) -
Least-Norm of the General Solution to Some System of Quaternion Matrix Equations and Its Determinantal Representations
by: Abdur Rehman, et al.
Published: (2019-01-01) -
Investigando os Números Híbridos de Jacobsthal através de uma abordagem epistemológica
by: Milena Carolina dos Santos Mangueira, et al.
Published: (2021-05-01)