Branch duplication in trees: uniqueness of seeds and enumeration of seeds
From MaRDI portal
Publication:3388060
DOI10.22199/ISSN.0717-6279-2020-02-0028zbMATH Open1451.05117OpenAlexW3023654862MaRDI QIDQ3388060
No author found.
Publication date: 8 January 2021
Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.22199/issn.0717-6279-2020-02-0028
Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Software, source code, etc. for problems pertaining to numerical analysis (65-04)
Cites Work
Related Items (4)
An explicit upper bound on disparity for trees of a given diameter โฎ Diminimal families of arbitrary diameter โฎ Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments โฎ Unnamed Item
Uses Software
Recommendations
- Unnamed Item ๐ ๐
- Unnamed Item ๐ ๐
- Unnamed Item ๐ ๐
- Uniqueness and minimal obstructions for tree-depth ๐ ๐
- Branching in the \({\Sigma^0_2}\)-enumeration degrees: a new perspective ๐ ๐
- Uniqueness thresholds on trees versus graphs ๐ ๐
- On certain trees with the same degree sequence ๐ ๐
- Branching structure of uniform recursive trees ๐ ๐
- Trees with unique minimum total dominating sets ๐ ๐
This page was built for publication: Branch duplication in trees: uniqueness of seeds and enumeration of seeds