On the public citation graph
(Total) Domination in Prisms
0 signed · 29 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/(sici)1097-0037(199810)32:3<199::aid-net4>3.0.co;2-fopenalex-snapshot
Paired-domination in graphs
inferredcites →https://doi.org/10.1002/jcd.20081openalex-snapshot
Optimal binary covering codes of length 2j
inferredcites →https://doi.org/10.1002/jgt.20565openalex-snapshot
Vizing's conjecture: a survey and recent results
inferredcites →https://doi.org/10.1007/s00373-004-0586-8openalex-snapshot
On the Total Domination Number of Cartesian Products of Graphs
inferredcites →https://doi.org/10.1007/s10623-004-3804-8openalex-snapshot
Bounds for Covering Codes over Large Alphabets
inferredcites →https://doi.org/10.1016/0893-9659(93)90027-kopenalex-snapshot
Independent domination in hypercubes
inferredcites →https://doi.org/10.1016/j.dam.2013.09.020openalex-snapshot
Perfect domination sets in Cayley graphs
inferredcites →https://doi.org/10.1109/18.2632openalex-snapshot
Improved sphere bounds on the covering radius of codes
inferredcites →https://doi.org/10.1109/18.945268openalex-snapshot
On the size of optimal binary codes of length 9 and covering radius 1
inferredcites →https://doi.org/10.1137/12090054xopenalex-snapshot
On the Concentration of the Domination Number of the Random Graph
inferredcites →https://doi.org/10.1137/s0895480194275825openalex-snapshot
Algorithms for Vertex Partitioning Problems on Partial k-Trees
inferredcites →https://doi.org/10.37236/2535openalex-snapshot
A Note on Total and Paired Domination of Cartesian Product Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-00256-5_12openalex-snapshot
Saving Probe Bits by Cube Domination
inferred← citeshttps://doi.org/10.1007/s10878-017-0150-0openalex-snapshot
A note on domination and total domination in prisms
inferred← citeshttps://doi.org/10.1007/s40840-020-00960-5openalex-snapshot
Domination in Rose Window Graphs
inferred← citeshttps://doi.org/10.1007/s40840-026-02060-2openalex-snapshot
On k-Rainbow Total Domination and a Related Conjecture
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112425openalex-snapshot
Bounding the k-rainbow total domination number
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113508openalex-snapshot
Unimodality and monotonic portions of certain domination polynomials
inferred← citeshttps://doi.org/10.1016/j.disc.2024.113875openalex-snapshot
Packings in bipartite prisms and hypercubes
inferred← citeshttps://doi.org/10.1063/5.0164731openalex-snapshot
Characterization of locating connected domination number on cyclic graphs
inferred← citeshttps://doi.org/10.1109/cec.2018.8477825openalex-snapshot
Quest for Good Spanners of Hypercubes
inferred← citeshttps://doi.org/10.2139/ssrn.7380670openalex-snapshot
Dual-Server Total Domination in Graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.1172.baeopenalex-snapshot
On domination-type invariants of Fibonacci cubes and hypercubes
inferred← citeshttps://doi.org/10.48550/arxiv.2103.10713openalex-snapshot
On Domatic and Total Domatic Numbers of Product Graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2256openalex-snapshot
Total domination in generalized prisms and a new domination invariant
inferred← citeshttps://doi.org/10.7151/dmgt.2421openalex-snapshot
Total and paired domination stability in prisms
inferred← citeshttps://doi.org/10.7151/dmgt.2503openalex-snapshot
Fractional eternal domination: securely distributing resources across a network
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.