On the public citation graph

Distinguishing Numbers for Graphs and Groups

https://doi.org/10.37236/1816
0 signed · 51 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1142/9789814439541_0007openalex-snapshot
Representation Theory
inferredcites →https://doi.org/10.37236/1242openalex-snapshot
Symmetry Breaking in Graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jgt.20171openalex-snapshot
Distinguishing geometric graphs
inferred← citeshttps://doi.org/10.1002/jgt.20190openalex-snapshot
Distinguishing Cartesian powers of graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_29openalex-snapshot
Labeling Schemes for Deterministic Radio Multi-broadcast
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/978-981-10-1651-6_20openalex-snapshot
Labeling of Sets Under the Actions of $$\overrightarrow{{S}_{n}} $$ and $$\overrightarrow{{A}_{n}}$$
inferred← citeshttps://doi.org/10.1007/s00454-008-9066-xopenalex-snapshot
Automorphisms and Distinguishing Numbers of Geometric Cliques
inferred← citeshttps://doi.org/10.1007/s00493-011-2221-7openalex-snapshot
Distinguishing labeling of the actions of almost simple groups
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-022-01214-2openalex-snapshot
Orbit closed permutation groups, relation groups, and simple groups
inferred← citeshttps://doi.org/10.1007/s13226-022-00314-wopenalex-snapshot
On distinguishing labelling of sets under the wreath product action
inferred← citeshttps://doi.org/10.1007/s13226-024-00535-1openalex-snapshot
Distinguishing labelling of sets under the wreath product action of $$\overrightarrow{A_{n}}$$
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.disc.2008.02.022openalex-snapshot
Distinguishing labeling of group actions
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.2019.103034openalex-snapshot
Distinguishing index of maps
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.1134/s1990478921010014openalex-snapshot
The Distinguishing Numbers and the Distinguishing Indexes of Cayley Graphs
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.1177/026142940502000211openalex-snapshot
‘Good Research’ Conducted by Talented High School Students: The Case of Sci-Tech
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.26493/1855-3974.428.296openalex-snapshot
Distinguishing partitions of complete multipartite graphs
inferred← citeshttps://doi.org/10.26637/mjm1101/007openalex-snapshot
On distinguishing labelling of groups for the conjugation action
inferred← citeshttps://doi.org/10.2991/acsr.k.220202.005openalex-snapshot
Distinguishing Number of the Generalized Theta Graph
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/1042openalex-snapshot
The Distinguishing Chromatic Number
inferred← citeshttps://doi.org/10.37236/1096openalex-snapshot
The Maximum Distinguishing Number of a Group
inferred← citeshttps://doi.org/10.37236/128openalex-snapshot
Fixing Numbers of Graphs and Groups
inferred← citeshttps://doi.org/10.37236/177openalex-snapshot
Bounds on the Distinguishing Chromatic Number
inferred← citeshttps://doi.org/10.37236/2117openalex-snapshot
Nordhaus-Gaddum Theorem for the Distinguishing Chromatic Number
inferred← citeshttps://doi.org/10.37236/2285openalex-snapshot
Distinguishing Trees in Linear Time
inferred← citeshttps://doi.org/10.37236/3066openalex-snapshot
The Distinguishing Chromatic Number of Kneser Graphs
inferred← citeshttps://doi.org/10.37236/537openalex-snapshot
Distinguishing Maps
inferred← citeshttps://doi.org/10.37236/938openalex-snapshot
Using Determining Sets to Distinguish Kneser Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1203.5765openalex-snapshot
Nordhaus-Gaddum Theorem for the Distinguishing Chromatic Number
inferred← citeshttps://doi.org/10.48550/arxiv.1301.4583openalex-snapshot
Distinguishing partitions of complete multipartite graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1807.04372openalex-snapshot
Fixing Numbers 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.1910.11806openalex-snapshot
Symmetry groups of boolean functions: simple 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
inferred← citeshttps://doi.org/10.5614/ejgta.2022.10.2.5openalex-snapshot
The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs
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.