On the public citation graph
Distinguishing Cartesian Powers of Graphs
0 signed · 48 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.2003.11.018openalex-snapshot
The distinguishing number of the hypercube
inferredcites →https://doi.org/10.37236/1361openalex-snapshot
A Note on the Asymptotics and Computational Complexity of Graph Distinguishability
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.20190openalex-snapshot
Distinguishing Cartesian powers of graphs
inferred← citeshttps://doi.org/10.1002/jgt.22704openalex-snapshot
Distinguishing orthogonality graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-39219-2_20openalex-snapshot
List Distinguishing Number of $$p^{\text {th}}$$ Power of Hypercube and Cartesian Powers of a 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/978-3-642-16023-3_44openalex-snapshot
Storage Capacity of Labeled 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/s10801-014-0529-2openalex-snapshot
Infinite motion and 2-distinguishability of graphs and groups
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.2020.06.007openalex-snapshot
Distinguishing numbers and distinguishing indices of oriented graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.04.070openalex-snapshot
Distinguishing colorings of Cartesian products of complete graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2009.11.021openalex-snapshot
The distinguishing chromatic number of Cartesian products of two complete graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2018.05.016openalex-snapshot
Distinguishing chromatic numbers of complements of Cartesian products of complete graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2019.03.001openalex-snapshot
List-distinguishing Cartesian products of cliques
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112512openalex-snapshot
The cost of 2-distinguishing hypercubes
inferred← citeshttps://doi.org/10.1016/j.ejc.2005.07.001openalex-snapshot
Cartesian powers of graphs can be distinguished by two labels
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.ic.2013.11.004openalex-snapshot
Effective storage capacity of labeled graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.02.032openalex-snapshot
Edge motion and the distinguishing index
inferred← citeshttps://doi.org/10.1017/9781316576571.005openalex-snapshot
The Cost of Distinguishing Graphs
inferred← citeshttps://doi.org/10.1080/02522667.2020.1773614openalex-snapshot
Distinguishing critical graphs
inferred← citeshttps://doi.org/10.1109/itsc.2007.4357816openalex-snapshot
Marker-Based Localizing for Indoor Navigation
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.245.348openalex-snapshot
Distinguishing numbers of Cartesian products of multiple complete graphs
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.37236/3223openalex-snapshot
The Cost of 2-Distinguishing Cartesian Powers
inferred← citeshttps://doi.org/10.37236/938openalex-snapshot
Using Determining Sets to Distinguish Kneser Graphs
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.2001.06300openalex-snapshot
Distinguishing simple groups
inferred← citeshttps://doi.org/10.48550/arxiv.2006.03739openalex-snapshot
Distinguishing Generalized Mycielskian Graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1902openalex-snapshot
Distinguishing Cartesian products of countable graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1927openalex-snapshot
The list distinguishing number equals the distinguishing number for interval 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.