On the public citation graph
Using Determining Sets to Distinguish Kneser Graphs
0 signed · 58 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.1002/jgt.20190openalex-snapshot
Distinguishing Cartesian powers of graphs
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.ejc.2005.07.001openalex-snapshot
Cartesian powers of graphs can be distinguished by two labels
inferredcites →https://doi.org/10.1016/j.jalgebra.2006.01.045openalex-snapshot
Distinguishing labellings of group action on vector spaces and graphs
inferredcites →https://doi.org/10.1016/s0012-365x(00)00217-xopenalex-snapshot
Circular chromatic number
inferredcites →https://doi.org/10.37236/1037openalex-snapshot
On Computing the Distinguishing Numbers of Trees and Forests
inferredcites →https://doi.org/10.37236/1096openalex-snapshot
The Maximum Distinguishing Number of a Group
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.37236/1984openalex-snapshot
Distinguishing Cartesian Powers of Graphs
inferredcites →https://doi.org/10.37236/932openalex-snapshot
Revisiting Two Classical Results on Graph Spectra
inferredcites →https://doi.org/10.37236/956openalex-snapshot
The Spectral Radius and the Maximum Degree of Irregular 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.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-77983-2_5openalex-snapshot
Symmetry Parameters for Mycielskian Graphs
inferred← citeshttps://doi.org/10.1007/s00026-024-00709-yopenalex-snapshot
Symmetry Parameters of Two-Generator Circulant 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-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/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.1016/j.bulsci.2021.102975openalex-snapshot
Distinguishing number of hierarchical products of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.10.006openalex-snapshot
The list distinguishing number of Kneser graphs
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.disc.2021.112512openalex-snapshot
The cost of 2-distinguishing hypercubes
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.pbiomolbio.2019.12.002openalex-snapshot
Projective mechanisms subtending real world phenomena wipe away cause effect relationships
inferred← citeshttps://doi.org/10.1017/9781316576571.005openalex-snapshot
The Cost of Distinguishing Graphs
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.2140/involve.2024.17.85openalex-snapshot
Edge-determining sets and determining index
inferred← citeshttps://doi.org/10.26493/1855-3974.31.d93openalex-snapshot
Small label classes in 2-distinguishing labelings
inferred← citeshttps://doi.org/10.26493/2590-9770.1463.f59openalex-snapshot
Paint cost and the frugal distinguishing number
inferred← citeshttps://doi.org/10.26493/2590-9770.1481.29dopenalex-snapshot
Symmetry parameters of various hypercube families
inferred← citeshttps://doi.org/10.3390/sym10080332openalex-snapshot
On the Distinguishing Number of Functigraphs
inferred← citeshttps://doi.org/10.3390/sym13061050openalex-snapshot
An Upper Bound Asymptotically Tight for the Connectivity of the Disjointness Graph of Segments in the Plane
inferred← citeshttps://doi.org/10.37236/3066openalex-snapshot
The Distinguishing Chromatic Number of Kneser 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.4134/bkms.2015.52.2.395openalex-snapshot
THE DISTINGUISHING NUMBERS OF MERGED JOHNSON GRAPHS
inferred← citeshttps://doi.org/10.46298/dmtcs.634openalex-snapshot
The determining number of Kneser graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.6678openalex-snapshot
On the connectivity of the disjointness graph of segments of point sets in general position in the plane
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.2006.03739openalex-snapshot
Distinguishing Generalized Mycielskian Graphs
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.