An asymmetrizing set of trees \(T\) is a set \(A\) of vertices of \(T\) such that the identity is the only automorphism of \(T\) which stabilizes \(A\). The similarity number \(s(T)\) (resp. asymmetrizing number \(a(T))\) of \(T\) is the cardinality of the set of orbits of subsets of vertices (resp. asymmetrizing sets) of \(T\). The author studies these two numbers for various kinds of (finite and infinite) trees. As main result a characterization of trees \(T\) with \(a(T)=2^{| T |}\) (resp. \(s(T)=2^{| T |})\) is given.
Recommendations
Cites work
Cited in
(15)- Asymmetrising sets in trees
- Asymmetrization of infinite trees
- Tree asymmetry -- a sensitive and practical measure for binary topological trees
- Counting asymmetric enriched trees
- The expected number of symmetries in locally restricted trees. II
- Asymmetrizing trees of maximum valence \(2^{\aleph_0}\)
- Almost all trees have quantum symmetry
- Counting trees using symmetries
- Smallest labelled class and largest automorphism group of a tree \(\tilde T_{s, t}\)
- scientific article; zbMATH DE number 1151852 (Why is no real title available?)
- scientific article; zbMATH DE number 871916 (Why is no real title available?)
- Finite and infinite vertex-transitive cubic graphs and their distinguishing cost and density
- On Symmetries of Non-Plane Trees in a Non-Uniform Model
- On pseudosimilarity in trees
- Improved algorithm for the symmetry number problem on trees
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)
