Identifying codes in graphs of given maximum degree: characterizing trees

DOI10.1016/J.DISC.2025.114826MaRDI QIDQ6884364zbMATH OpenFDO

Authors Dipayan Chakraborty, Florent Foucaud, Michael A. Henning, Tuomo Lehtilä

Publication date 15 December 2025

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

treesidentifying codesmaximum degree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Theory of error-correcting codes and error-detecting codes (94B99)

This page was built for publication: Identifying codes in graphs of given maximum degree: characterizing trees

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