Pith. sign in

REVIEW

Locating dominating codes: Bounds and extremal cardinalities

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1205.2177 v1 pith:REAJIT2K submitted 2012-05-10 math.CO cs.ITmath.IT

José Cáceres , Carmen Hernando , Mercè Mora , Ignacio M. Pelayo , María Luz Puertas This is my paper · ORCID
classification math.COcs.ITmath.IT
keywords codesboundsconcerningextremalcardinalitiescontributionscontrollingdetectors
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

In this work, two types of codes such that they both dominate and locate the vertices of a graph are studied. Those codes might be sets of detectors in a network or processors controlling a system whose set of responses should determine a malfunctioning processor or an intruder. Here, we present our more significant contributions on \lambda-codes and \eta-codes concerning concerning bounds, extremal values and realization theorems.

Discussion (0). Continue with ORCID to comment.

Pith tools