On the public citation graph
Fixing Numbers of Graphs and Groups
0 signed · 35 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.1016/0021-8693(89)90256-1openalex-snapshot
Chains of subgroups in symmetric groups
inferredcites →https://doi.org/10.1016/j.disc.2006.06.004openalex-snapshot
Destroying automorphisms by fixing nodes
inferredcites →https://doi.org/10.1016/s0195-6698(80)80043-6openalex-snapshot
On Graphs with Given Automorphism Group
inferredcites →https://doi.org/10.1017/s0004972700012995openalex-snapshot
Distance transitive graphs with symmetric or alternating automorphism group
inferredcites →https://doi.org/10.1017/s144678870003473xopenalex-snapshot
Vertex-transitive graphs which are not Cayley graphs, I
inferredcites →https://doi.org/10.37236/1104openalex-snapshot
Identifying Graph Automorphisms Using Determining Sets
inferredcites →https://doi.org/10.37236/1816openalex-snapshot
Distinguishing Numbers for Graphs and Groups
inferredcites →https://doi.org/10.4153/cjm-1949-033-6openalex-snapshot
Graphs of Degree Three with a Given Abstract Group
inferredcites →https://doi.org/10.5860/choice.41-2860openalex-snapshot
Topics in graph automorphisms and reconstruction
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00373-021-02300-1openalex-snapshot
Graphs of Order n with Determining Number $$n{-}3$$
inferred← citeshttps://doi.org/10.1007/s13226-023-00421-2openalex-snapshot
On automorphisms and fixing number of co-normal product of graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2014.10.034openalex-snapshot
The difference between the metric dimension and the determining number of a graph
inferred← citeshttps://doi.org/10.1016/j.disc.2017.05.008openalex-snapshot
Graphs and their associated inverse semigroups
inferred← citeshttps://doi.org/10.1016/j.disc.2018.10.007openalex-snapshot
On the fixing sets of dihedral groups
inferred← citeshttps://doi.org/10.1016/j.disc.2019.06.001openalex-snapshot
Base size sets and determining sets
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.heliyon.2023.e19820openalex-snapshot
Symmetries and symmetry-breaking in arithmetic graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2019.07.001openalex-snapshot
Some properties of alternating group networks
inferred← citeshttps://doi.org/10.1093/imrn/rnq024openalex-snapshot
Discrete Non-commutative Integrability: Proof of a Conjecture by M. Kontsevich
inferred← citeshttps://doi.org/10.1112/blms/bdq096openalex-snapshot
Base size, metric dimension and other invariants of groups and graphs
inferred← citeshttps://doi.org/10.1142/s0219498821500018openalex-snapshot
Planarity and fixing number of inclusion graph of a nilpotent group
inferred← citeshttps://doi.org/10.2140/involve.2024.17.85openalex-snapshot
Edge-determining sets and determining index
inferred← citeshttps://doi.org/10.2140/pjm.2017.286.385openalex-snapshot
Calculating Greene’s function via root polytopes and subdivision algebras
inferred← citeshttps://doi.org/10.3390/math11061322openalex-snapshot
Fixing Numbers of Point-Block Incidence Graphs
inferred← citeshttps://doi.org/10.3390/math9020166openalex-snapshot
Removing Symmetry in Circulant Graphs and Point-Block Incidence Graphs
inferred← citeshttps://doi.org/10.37236/335openalex-snapshot
On the Determining Number and the Metric Dimension of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1111.3252openalex-snapshot
Hypergraphs for computing determining sets of Kneser graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1401.3686openalex-snapshot
Resolving sets for breaking symmetries of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1411.4922openalex-snapshot
On some automorphism related parameters in graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1507.02053openalex-snapshot
On fixing sets of composition and corona product of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1705.08681openalex-snapshot
On The Fixatic Number of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1804.09701openalex-snapshot
Automorphism related parameters of a graph associated to a finite vector space
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.