On the public citation graph
The Maximum Distinguishing Number of a Group
0 signed · 36 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/s10801-006-0006-7openalex-snapshot
The distinguishing number of the direct product and wreath product action
inferredcites →https://doi.org/10.1016/j.disc.2003.11.018openalex-snapshot
The distinguishing number of the hypercube
inferredcites →https://doi.org/10.1016/j.disc.2006.09.056openalex-snapshot
The distinguishing number of the augmented cube and hypercube powers
inferredcites →https://doi.org/10.37236/1361openalex-snapshot
A Note on the Asymptotics and Computational Complexity of Graph Distinguishability
inferredcites →https://doi.org/10.37236/1816openalex-snapshot
Distinguishing Numbers for Graphs and Groups
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-21840-3_7openalex-snapshot
Generation of Colourings and Distinguishing Colourings of Graphs
inferred← citeshttps://doi.org/10.1007/s00013-019-01324-7openalex-snapshot
The distinguishing number of quasiprimitive and semiprimitive groups
inferred← citeshttps://doi.org/10.1007/s00454-008-9066-xopenalex-snapshot
Automorphisms and Distinguishing Numbers of Geometric Cliques
inferred← citeshttps://doi.org/10.1007/s10801-006-0006-7openalex-snapshot
The distinguishing number of the direct product and wreath product action
inferred← citeshttps://doi.org/10.1007/s10801-014-0529-2openalex-snapshot
Infinite motion and 2-distinguishability of graphs and groups
inferred← citeshttps://doi.org/10.1016/j.disc.2006.09.056openalex-snapshot
The distinguishing number of the augmented cube and hypercube powers
inferred← citeshttps://doi.org/10.1016/j.ejc.2007.11.018openalex-snapshot
The distinguishing number of Cartesian products of complete graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2018.03.008openalex-snapshot
Extending precolorings to distinguish group actions
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103414openalex-snapshot
Distinguishing index of graphs with simple automorphism groups
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2006.01.045openalex-snapshot
Distinguishing labellings of group action on vector spaces and graphs
inferred← citeshttps://doi.org/10.1080/02522667.2021.2003011openalex-snapshot
The distinguishing number of groups based on the distinguishing number of subgroups
inferred← citeshttps://doi.org/10.1134/s0081543808050106openalex-snapshot
On primitive permutation groups with nontrivial global stabilizers
inferred← citeshttps://doi.org/10.1137/060651392openalex-snapshot
Distinguishing Chromatic Number of Cartesian Products of Graphs
inferred← citeshttps://doi.org/10.1137/07068686xopenalex-snapshot
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach
inferred← citeshttps://doi.org/10.1137/080728640openalex-snapshot
Breaking the Symmetries of the Book Graph and the Generalized Petersen Graph
inferred← citeshttps://doi.org/10.26493/1855-3974.192.531openalex-snapshot
Motion and distinguishing number two
inferred← citeshttps://doi.org/10.26493/1855-3974.195.d00openalex-snapshot
Distinguishing partitions and asymmetric uniform hypergraphs
inferred← citeshttps://doi.org/10.3390/sym10080332openalex-snapshot
On the Distinguishing Number of Functigraphs
inferred← citeshttps://doi.org/10.37236/1037openalex-snapshot
On Computing the Distinguishing Numbers of Trees and Forests
inferred← citeshttps://doi.org/10.37236/938openalex-snapshot
Using Determining Sets to Distinguish Kneser Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0806.2078openalex-snapshot
Distinguishing Primitive Permutation Groups
inferred← citeshttps://doi.org/10.48550/arxiv.1304.6436openalex-snapshot
Infinite Motion and 2-Distinguishability of Graphs and Groups
inferred← citeshttps://doi.org/10.48550/arxiv.1808.01074openalex-snapshot
Distinguishing Numbers and Generalizations
inferred← citeshttps://doi.org/10.48550/arxiv.1808.08705openalex-snapshot
The distinguishing number of quasiprimitive and semiprimitive groups
inferred← citeshttps://doi.org/10.48550/arxiv.2001.06300openalex-snapshot
Distinguishing simple groups
inferred← citeshttps://doi.org/10.48550/arxiv.2009.09275openalex-snapshot
Distinguishing actions of symmetric groups and related graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2107.09452openalex-snapshot
Asymmetric edge-coloring of graphs with simple automorphism group
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.