On trees with exactly one characteristic element
From MaRDI portal
Publication:869893
DOI10.1016/J.LAA.2006.04.016zbMATH Open1115.05055OpenAlexW2060786369MaRDI QIDQ869893FDOQ869893
Authors: Yizheng Fan, Shi-Cai Gong, Yi Wang, Yubin Gao
Publication date: 9 March 2007
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2006.04.016
Recommendations
- On a Characterization of Trees
- A New Characterization of Trees
- scientific article
- 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.
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Matrix Analysis
- Title not available (Why is that?)
- Laplacian matrices of graphs: A survey
- Title not available (Why is that?)
- A relation between the matching number and Laplacian spectrum of a graph
- Laplace eigenvalues of graphs---a survey
- Eigenvectors of acyclic matrices
- Algebraic connectivity and the characteristic set of a graph
- Characteristic vertices of trees*
- 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)