On trees with exactly one characteristic element
From MaRDI portal
Recommendations
- On a Characterization of Trees
- A New Characterization of Trees
- scientific article; zbMATH DE number 5302585
- A characterization of \(k\)-trees
- Trees whose domination subdivision number is one
- Trees with 1-factors and oriented trees
- On trees with Laplacian eigenvalue one
- The number of trees with a 1-factor
- Trees with domination subdivision number one
- On a characterization of \(k\)-trees.
Cites work
- scientific article; zbMATH DE number 3681933 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- A relation between the matching number and Laplacian spectrum of a graph
- Algebraic connectivity and the characteristic set of a graph
- Characteristic vertices of trees*
- Eigenvectors of acyclic matrices
- Laplace eigenvalues of graphs---a survey
- Laplacian matrices of graphs: A survey
- Matrix Analysis
- The third smallest eigenvalue of the Laplacian matrix
Cited in
(5)
This page was built for publication: On trees with exactly one characteristic element
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869893)