Asymmetrising sets in trees

DOI10.1016/0012-365X(91)90341-XzbMath0759.05029MaRDI QIDQ1191926

Gert Sabidussi, Norbert Polat

Publication date: 27 September 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

treesregular treerooted treesasymmetrising setsendpoint-free tree

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75)

Related Items (6)

Finite and infinite vertex-transitive cubic graphs and their distinguishing cost and density ⋮ Asymmetrizing trees of maximum valence \(2^{\aleph_0}\) ⋮ Asymmetrization of infinite trees ⋮ Similarity and asymmetrization of trees ⋮ Distinguishing graphs of maximum valence 3 ⋮ Number of distinguishing colorings and partitions

Cites Work

• Asymmetrization of infinite trees
• Über unendliche Wege in Graphen
• \(A\,V^ 2\) algorithm for determining isomorphism of planar graphs
• Asymmetric trees with two prescribed degrees

This page was built for publication: Asymmetrising sets in trees