Partial linear spaces and identifying codes

DOI10.1016/j.ejc.2010.10.014zbMath1213.05041OpenAlexW2084531349MaRDI QIDQ627920

J. Carlos Valenzuela-Tripodoro, Gabriela Araujo-Pardo, Luis Pedro Montejano, Camino Balbuena

Publication date: 4 March 2011

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2010.10.014

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex degrees (05C07)

Related Items

An Alternative Way to Generalize the Pentagon ⋮ Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages
• Improved bounds on identifying codes in binary Hamming spaces
• New identifying codes in the binary Hamming space
• Upper bounds for binary identifying codes
• Construction of codes identifying sets of vertices
• Identifying and locating-dominating codes on chains and cycles
• Dynamic cage survey
• On cages admitting identifying codes
• Incidence Matrices of Projective Planes and of Some Regular Bipartite Graphs of Girth 6 with Few Vertices
• Cages—a survey
• The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
• On a new class of codes for identifying vertices in graphs
• On the Non-Existence of a Type of Regular Graphs of Girth 5