Similarity and asymmetrization of trees
From MaRDI portal
Publication:686304
DOI10.1016/0012-365X(92)90293-OzbMATH Open0783.05040MaRDI QIDQ686304FDOQ686304
Authors: Norbert Polat
Publication date: 14 October 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Trees (05C05) Paths and cycles (05C38) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)
Cites Work
Cited In (12)
- Finite and infinite vertex-transitive cubic graphs and their distinguishing cost and density
- Asymmetrising sets in trees
- Asymmetrization of infinite trees
- Improved algorithm for the symmetry number problem on trees
- On Symmetries of Non-Plane Trees in a Non-Uniform Model
- Counting asymmetric enriched trees
- Title not available (Why is that?)
- On pseudosimilarity in trees
- Almost all trees have quantum symmetry
- Tree asymmetry -- a sensitive and practical measure for binary topological trees
- Counting trees using symmetries
- Asymmetrizing trees of maximum valence \(2^{\aleph_0}\)
This page was built for publication: Similarity and asymmetrization of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686304)