On the public citation graph

On the domination number of prisms of graphs

0 signed · 17 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/jcd.20008openalex-snapshot
An updated table of binary/ternary mixed covering codes
inferredcites →https://doi.org/10.1109/18.2632openalex-snapshot
Improved sphere bounds on the covering radius of codes

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

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/s12190-014-0755-8openalex-snapshot
On the geodetic number of permutation graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.11.006openalex-snapshot
Bipartite graphs are not universal fixers
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.053openalex-snapshot
Claw-free graphs are not universal fixers
inferred← citeshttps://doi.org/10.1016/j.disc.2008.09.016openalex-snapshot
Regular graphs are not universal fixers
inferred← citeshttps://doi.org/10.1016/j.disc.2009.12.007openalex-snapshot
Domination of generalized Cartesian products
inferred← citeshttps://doi.org/10.1142/s1793830917500094openalex-snapshot
Disjunctive total domination in permutation graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1309.0603openalex-snapshot
Graphs with $C_3_-free vertices are not universal fixers
inferred← citeshttps://doi.org/10.7151/dmgt.1377openalex-snapshot
Couterexample to a conjecture on the structure of bipartite partionable graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1378openalex-snapshot
Fractional domination in prisms
inferred← citeshttps://doi.org/10.7151/dmgt.1526openalex-snapshot
Paired domination in prisms of graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1594openalex-snapshot
Characterizing Cartesian fixers and multipliers
inferred← citeshttps://doi.org/10.7151/dmgt.1600openalex-snapshot
Domination in functigraphs
inferred← citeshttps://doi.org/10.7151/dmgt.1631openalex-snapshot
Convex universal fixers
inferred← citeshttps://doi.org/10.7151/dmgt.2207openalex-snapshot
Convex and weakly convex domination in prism 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.