Asymmetric trees with two prescribed degrees
From MaRDI portal
Publication:4111599
DOI10.1007/BF01896481zbMath0344.05127MaRDI QIDQ4111599
Publication date: 1977
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Trees (05C05) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items
The role of the Axiom of Choice in proper and distinguishing colourings ⋮ Finite and infinite vertex-transitive cubic graphs and their distinguishing cost and density ⋮ Two sufficient conditions for non-normal Cayley graphs and their applications ⋮ Distinguishing arc-colourings of symmetric digraphs ⋮ Number of colors needed to break symmetries of a graph by an arbitrary edge coloring ⋮ Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed ⋮ On digraphs with circulant adjacent matrices ⋮ On circulant digraphs with regular automorphism groups ⋮ Asymmetric edge-colorings of graphs with three colors ⋮ On a theorem of Halin ⋮ Asymmetrizing trees of maximum valence \(2^{\aleph_0}\) ⋮ Distinguishing threshold of graphs ⋮ Distinguishing infinite graphs with bounded degrees ⋮ Asymmetric colouring of locally compact permutation groups ⋮ The distinguishing index of graphs with infinite minimum degree ⋮ A bound for the distinguishing index of regular graphs ⋮ The finite simple groups with at most two fusion classes of every order ⋮ The finite groups with the 2-dci property ⋮ Groups with a Cayley graph isomorphic to a hypercube ⋮ On finite groups with the Cayley invariant property ⋮ Asymmetrising sets in trees ⋮ Asymmetrization of infinite trees ⋮ Distinguishing Generalized Mycielskian Graphs ⋮ Distinguishing index of maps ⋮ Asymmetric colorings of products of graphs and digraphs ⋮ Distinguishing graphs of maximum valence 3 ⋮ Symmetry parameters for Mycielskian graphs ⋮ Number of distinguishing colorings and partitions ⋮ Proper distinguishing arc-colourings of symmetric digraphs ⋮ On isomorphisms of connected Cayley graphs, III ⋮ Distinguishing number of universal homogeneous Urysohn metric spaces ⋮ Coarse distinguishability of graphs with symmetric growth
Cites Work
- Groups represented by homeomorphism groups. I
- Graphs with given infinite group
- Symmetric relations (undirected graphs) with given semigroups
- How comprehensive is the category of semigroups?
- Every finite graph is a full subgraph of a rigid graph
- On a technique for representing semigroups as endomorphism semigroups of graphs with given properties
- Graphs with Given Group and Given Graph-Theoretical Properties
- On Rigid Undirected Graphs
- The Category of Graphs with a Given Subgraph-with Applications to Topology and Algebra
- Graphs and k-Societies
- Graphs of Degree Three with a Given Abstract Group
- Unnamed Item
- Unnamed Item