
handle: 11468/21054
Summary: In this paper, we define two \(n\times n\) Hessenberg matrices, one of which corresponds to the adjacency matrix of a bipartite graph. We then investigate the relationships between the Hessenberg matrices and the Jacobsthal numbers. Moreover, we give Maple algorithms to verify our results.
Bipartite graph, Jacobsthal number, Hessenberg matrix, Graphs and linear algebra (matrices, eigenvalues, etc.), Special sequences and polynomials, bipartite graph, Bipartite Graph, Hessenberg Matrix, Permanent, Determinants, permanents, traces, other special matrix functions, Jacobsthal Number, permanent, Combinatorial aspects of matrices (incidence, Hadamard, etc.)
Bipartite graph, Jacobsthal number, Hessenberg matrix, Graphs and linear algebra (matrices, eigenvalues, etc.), Special sequences and polynomials, bipartite graph, Bipartite Graph, Hessenberg Matrix, Permanent, Determinants, permanents, traces, other special matrix functions, Jacobsthal Number, permanent, Combinatorial aspects of matrices (incidence, Hadamard, etc.)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
