Path polynomials of a circuit: a constructive approach
Let \(P_k\) denote the polynomial of the path on \(k\) vertices. A complete description of the matrix \(P_k(C_n)\), where \(C_n\) is the circuit on \(n\) vertices, is given using some important concepts of the theory of circulant matrices. \(Q_k\), the polynomial of the circuit on \(k\) vertices is also considered. Using orthogonal polynomials constructive proofs of some results obtained recently by \textit{R. B. Bapat} and \textit{A. K. Lal} [Linear Algebra Appl. 149, 125-149 (1991; Zbl 0764.05056)], \textit{R. A. Beezer} [ibid. 63, 221-225 (1984; Zbl 0552.05041)] and \textit{R. Shi} [ibid. 236, 181-187 (1996; Zbl 0843.05077)] are presented.
- Explicit inverse of a tridiagonal k-Toeplitz matrix
- Unifying some Pell and Fibonacci identities
- Determinants of box products of paths
- scientific article; zbMATH DE number 1052837 (Why is no real title available?)
- The path polynomial of a complete graph
- Some comments on the properties of a particular tridiagonal matrix
- On irreducible denumerable continuous parameter circuit chains: Analysis of a generalized sample path case
- Recursions and characteristic polynomials of the rows of the circuit array
This page was built for publication: Path polynomials of a circuit: a constructive approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4222259)