Matchings in starlike trees
From MaRDI portal
In this short paper the authors show that the relation \(T_1\preceq T_2\) holds for various pairs of starlike trees \(T_1\), \(T_2\). The starlike trees (with a given number of vertices), extremal with respect to the relation \(\preceq\), are characterized.
Recommendations
Cites work
- An introduction to matching polynomials
- scientific article; zbMATH DE number 3720958 (Why is no real title available?)
- scientific article; zbMATH DE number 3608048 (Why is no real title available?)
- scientific article; zbMATH DE number 3893246 (Why is no real title available?)
- On acyclic conjugated molecules with minimal energies
- On minimal energy ordering of acyclic conjugated molecules
- On the ordering of graphs with respect to their matching numbers
- On the theory of the matching polynomial
Cited in
(9)- Characteristics polynomial of normalized Laplacian for trees
- Vertex-degree-based topological indices over starlike trees
- Extremal polyomino chains on k-matchings and k-independent sets
- On the ordering of starlike trees with respect to Merrifield-Simmons indices
- Vertex-degree-based topological indices over trees with two branching vertices
- Extremal values of Merrifield-Simmons index for trees with two branching vertices
- Consecutive chemical trees with respect to energy of graph
- Extremal energies of trees with a given domination number
- Graphs cospectral with starlike trees
This page was built for publication: Matchings in starlike trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5950594)