scientific article; zbMATH DE number 1472121
From MaRDI portal
Publication:4489172
Recommendations
- Computing the characteristic polynomial of a tree
- scientific article; zbMATH DE number 2235064
- Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks
- Efficient computation of the characteristic polynomial of a tree and related tasks
- Computing the characteristic polynomial of threshold graphs
Cited in
(20)- Computing the characteristic polynomial of a tree
- Evaluation of the characteristic polynomial of a graph
- On the core-nilpotent decomposition of trees
- The determinant of a unicyclic graph's neighborhood matrix
- Linear-time LUP decomposition of forest-like matrices
- The inverse characteristic polynomial problem for trees
- The characteristic polynomial of generalized lollipop graphs
- Laplacian energy of diameter 3 trees
- Computing the characteristic polynomial of threshold graphs
- Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks
- scientific article; zbMATH DE number 977801 (Why is no real title available?)
- Reducing the adjacency matrix of a tree
- The Laplacian energy of diameter 4 trees
- On a conjecture of Laplacian energy of trees
- Efficient computation of the characteristic polynomial of a tree and related tasks
- scientific article; zbMATH DE number 2235064 (Why is no real title available?)
- The level matrix of a tree and its spectrum
- On the energy of some tree dendrimers
- On Radenković and Gutman conjecture for some classes of trees of diameter 5
- Applications of recurrence relations for the characteristic polynomials of Bethe trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4489172)
