Bound of r-identifying and r-locating-dominating codes in the Kronecker product graph of cy_n and k₂

MaRDI QIDQ4981052zbMATH OpenFDO

Authors Liqun Pu, Yanling Chai

Publication date 30 June 2014

zbMATH Keywords

\(r\)-ID code\(r\)-LD codeKronecker productthe smallest cardinality

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Combinatorial codes (94B25)

Recommendations

• Identifying and locating-dominating codes on chains and cycles
• Extremal cardinalities for identifying and locating-dominating codes in graphs
• On a new class of identifying codes in graphs
• New bounds on binary identifying codes
• Identifying codes and locating-dominating sets on paths and cycles

Cited in

(1)

• On \((r,\leq 2)\)-locating-dominating codes in the infinite King grid

This page was built for publication: Bound of \(r\)-identifying and \(r\)-locating-dominating codes in the Kronecker product graph of \(cy_n\) and \(\overline{k}_2\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4981052)