On the polynomial of a path
From MaRDI portal
Let \(A(P_ n)\) be 0-1 adjacency matrix of the path \(P_ n\) on n vertices. Let r(\(\lambda)\) be a polynomial of degree less than n and consider the matrix \(M=r(A(P_ n))\). In this paper all polynomials for which M is the adjacency matrix of a graph are determined.
Recommendations
Cited in
(16)- Commutativity of the adjacency matrices of graphs
- Polynomials on graphs
- Trivalent orbit polynomial graphs
- Path-positive graphs
- Paths on polymatroids
- Disproof of a conjecture on the existence of the path-recursive period for a connected graph
- Path polynomials of a graph
- Signatures of paths transformed by polynomial maps
- Spectra of \((H_1, H_2)\)-merged subdivision graph of a graph
- Return polynomials for non-intersecting paths above a surface on the directed square lattice
- scientific article; zbMATH DE number 6708186 (Why is no real title available?)
- scientific article; zbMATH DE number 3963880 (Why is no real title available?)
- Path polynomials of a circuit: a constructive approach
- scientific article; zbMATH DE number 2201913 (Why is no real title available?)
- Characteristic polynomial of path semigraphs
- Pattern polynomial graphs
This page was built for publication: On the polynomial of a path
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800940)