Codes Identifying Vertices in Graphs

DOI10.1016/J.ENDM.2005.06.060MaRDI QIDQ3439339zbMATH OpenOpenAlexFDO

Authors Julien Moncel

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2005.06.060

zbMATH Keywords

graph theoryidentifying codes

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorial codes (94B25) Fault detection; testing in circuits and networks (94C12)

Recommendations

• On a new class of codes for identifying vertices in graphs
• Publication:4474243
• On cages admitting identifying codes
• On a new class of identifying codes in graphs
• Codes identifying sets of vertices in random networks

Cites work

• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• scientific article; zbMATH DE number 2081125 (Why is no real title available?)
• Codes identifying sets of vertices in random networks
• Construction of codes identifying sets of vertices
• Nonrandom binary superimposed codes
• On a new class of codes for identifying vertices in graphs

Cited in

(8)

• Codes identifying sets of vertices in random networks
• An unexpected result in coding the vertices of a graph
• Vertex identifying codes for fault isolation in communication networks
• On two variations of identifying codes
• scientific article; zbMATH DE number 4139806 (Why is no real title available?)
• Combinatorial identification problems and graph powers
• Edge identifying codes
• scientific article; zbMATH DE number 3974897 (Why is no real title available?)

This page was built for publication: Codes Identifying Vertices in Graphs

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