New results on variants of covering codes in Sierpiński graphs (Q2391669): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1201.1202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive identification in Torii in the King lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Minimum Density of Codes Identifying Vertices in the Square Grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying and locating-dominating codes on chains and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: New identifying codes in the binary Hamming space / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum density of an identifying code in the king lattice. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying codes and locating-dominating sets on paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error-correcting codes on the Towers of Hanoi graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds on identifying codes in binary Hamming spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of identifying codes in triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes and \(L(2,1)\)-labelings in Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on variants of covering codes in Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying codes of Cartesian product of two cliques of the same size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying codes of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tower of Hanoi – Myths and Maths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On identifying codes in the King grid that are robust against edge deletions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3447617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal identifying codes in cycles and paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Sierpiński graphs and Sierpiński gasket graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-, edge-, and total-colorings of Sierpiński-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs S(n, k) and a Variant of the Tower of Hanoi Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-perfect codes in Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing numbers of Sierpiński‐like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect codes on the towers of Hanoi graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lipscomb's L(A) Space Fractalized in Hilbert's l 2 (A) Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractals and Universal Spaces in Dimension Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3136012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On perfect codes in Cartesian products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity of the minimum cardinality of an identifying code in the hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating sensors in paths and cycles: the case of 2-identifying codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying codes of cycles with odd orders / rank
 
Normal rank

Latest revision as of 17:55, 6 July 2024

scientific article
Language Label Description Also known as
English
New results on variants of covering codes in Sierpiński graphs
scientific article

    Statements

    New results on variants of covering codes in Sierpiński graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 August 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    codes in graphs
    0 references
    identifying codes
    0 references
    locating-dominating codes
    0 references
    total-domination
    0 references
    Sierpiński graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references