On the public citation graph
Identifying Graph Automorphisms Using Determining Sets
0 signed · 69 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/j.disc.2006.06.004openalex-snapshot
Destroying automorphisms by fixing nodes
inferredcites →https://doi.org/10.1016/s0166-218x(00)00198-0openalex-snapshot
Resolvability in graphs and the metric dimension of a graph
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.20368openalex-snapshot
The determining number of a Cartesian product
inferred← citeshttps://doi.org/10.1002/jgt.22704openalex-snapshot
Distinguishing orthogonality graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-39219-2_11openalex-snapshot
Determining Number of Generalized and Double Generalized Petersen Graph
inferred← citeshttps://doi.org/10.1007/978-3-030-77983-2_5openalex-snapshot
Symmetry Parameters for Mycielskian Graphs
inferred← citeshttps://doi.org/10.1007/s00373-010-0880-6openalex-snapshot
Determining Sets, Resolving Sets, and the Exchange Property
inferred← citeshttps://doi.org/10.1007/s00373-015-1540-7openalex-snapshot
Fixing Numbers for Matroids
inferred← citeshttps://doi.org/10.1007/s00373-019-02014-5openalex-snapshot
The Full Automorphism Groups, Determining Sets and Resolving Sets of Coprime Graphs
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/s00373-021-02452-0openalex-snapshot
On Maximal Det-Independent (Res-Independent) Sets in Graphs
inferred← citeshttps://doi.org/10.1007/s00454-008-9066-xopenalex-snapshot
Automorphisms and Distinguishing Numbers of Geometric Cliques
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.amc.2018.03.053openalex-snapshot
Metric-locating-dominating sets of graphs for constructing related subsets of vertices
inferred← citeshttps://doi.org/10.1016/j.dam.2018.10.021openalex-snapshot
On the distinguishing number of cyclic tournaments: Towards the Albertson–Collins Conjecture
inferred← citeshttps://doi.org/10.1016/j.dam.2019.02.005openalex-snapshot
Identifying codes on directed de Bruijn graphs
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.disc.2022.113310openalex-snapshot
Levenshtein graphs: Resolvability, automorphisms & determining sets
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.10.008openalex-snapshot
Resolving sets for Johnson and Kneser graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2006.06.036openalex-snapshot
Some structural, metric and convex properties on the boundary of a graph
inferred← citeshttps://doi.org/10.1016/j.endm.2011.09.095openalex-snapshot
Symmetry Breaking in Tournaments
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.1080/00927872.2025.2573411openalex-snapshot
On the metric dimension of the character degree graph of a solvable group
inferred← citeshttps://doi.org/10.1080/03081087.2022.2121370openalex-snapshot
On some properties of vector space based graphs
inferred← citeshttps://doi.org/10.1080/09728600.2024.2365338openalex-snapshot
On the determining number of some graphs
inferred← citeshttps://doi.org/10.1090/proc/15154openalex-snapshot
The isometry group of phylogenetic tree space is 𝑆_{𝑛}
inferred← citeshttps://doi.org/10.1109/cdc.2014.7039451openalex-snapshot
On symmetry and controllability of multi-agent systems
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.1137/21m1409512openalex-snapshot
Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
inferred← citeshttps://doi.org/10.1142/s0219498821500018openalex-snapshot
Planarity and fixing number of inclusion graph of a nilpotent group
inferred← citeshttps://doi.org/10.1142/s0219498822500232openalex-snapshot
Automorphism group and fixing number of the orthogonality graph based on rank one upper triangular matrices
inferred← citeshttps://doi.org/10.1142/s0219498823501505openalex-snapshot
The automorphism group and fixing number of the orthogonality graph of the full matrix ring
inferred← citeshttps://doi.org/10.1145/3558077openalex-snapshot
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs
inferred← citeshttps://doi.org/10.1155/2021/5595620openalex-snapshot
Automorphism Group and Other Properties of Zero Component Graph over a Vector Space
inferred← citeshttps://doi.org/10.21236/ada623527openalex-snapshot
Identifying Codes on Directed De Bruijn Graphs
inferred← citeshttps://doi.org/10.22124/jart.2020.16856.1209openalex-snapshot
Determining Number of Some Families of Cubic Graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.31.d93openalex-snapshot
Small label classes in 2-distinguishing labelings
inferred← citeshttps://doi.org/10.26493/1855-3974.428.296openalex-snapshot
Distinguishing partitions of complete multipartite graphs
inferred← citeshttps://doi.org/10.3390/math11061322openalex-snapshot
Fixing Numbers of Point-Block Incidence Graphs
inferred← citeshttps://doi.org/10.3390/math7111111openalex-snapshot
Removing Twins in Graphs to Break Symmetries
inferred← citeshttps://doi.org/10.3390/math9020166openalex-snapshot
Removing Symmetry in Circulant Graphs and Point-Block Incidence Graphs
inferred← citeshttps://doi.org/10.3390/sym10080332openalex-snapshot
On the Distinguishing Number of Functigraphs
inferred← citeshttps://doi.org/10.3390/sym15091737openalex-snapshot
On Laplacian Eigenvalues of Wheel Graphs
inferred← citeshttps://doi.org/10.37236/3223openalex-snapshot
The Cost of 2-Distinguishing Cartesian Powers
inferred← citeshttps://doi.org/10.37236/335openalex-snapshot
On the Determining Number and the Metric Dimension of Graphs
inferred← citeshttps://doi.org/10.37236/4263openalex-snapshot
Infinite Graphs with Finite 2-Distinguishing Cost
inferred← citeshttps://doi.org/10.37236/938openalex-snapshot
Using Determining Sets to Distinguish Kneser Graphs
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2016.13openalex-snapshot
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.634openalex-snapshot
The determining number of Kneser graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.7627openalex-snapshot
Determining Number of Kneser Graphs: Exact Values and Improved Bounds
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.1301.4583openalex-snapshot
Distinguishing partitions of complete multipartite 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.1507.02053openalex-snapshot
On fixing sets of composition and corona product of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1610.09232openalex-snapshot
On the Fractional fixing number of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1611.03346openalex-snapshot
On Fixing number of Functigraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1705.08681openalex-snapshot
On The Fixatic Number of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1807.04372openalex-snapshot
Fixing Numbers of Graphs and Groups
inferred← citeshttps://doi.org/10.48550/arxiv.1910.12101openalex-snapshot
The Cost of Edge-distinguishing of the Cartesian Product of Connected Graphs
inferred← citeshttps://doi.org/10.5614/ejgta.2024.12.1.6openalex-snapshot
Edge-locating coloring of graphs
inferred← citeshttps://doi.org/10.5802/alco.370openalex-snapshot
The base size of the symmetric group acting on subsets
inferred← citeshttps://doi.org/10.7151/dmgt.2438openalex-snapshot
Determining number and cost of generalized Mycielskian 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.