Erratum to ``Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs.

DOI10.3934/AMC.2009.3.429zbMATH Open1193.05157OpenAlexW4248710722MaRDI QIDQ2268675FDOQ2268675

Authors: David Auger, Irène Charon, Olivier Hudry, Iiro Honkala, Antoine Lobstein 

Publication date: 8 March 2010

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2009.3.429

zbMATH Keywords

graph theorytwinsminimum degreediameterradiusidentifying codemaximum independent setmaximum stable settwin-free graphidentifiable graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Cited In (1)

• Locating-Domination and Identification

This page was built for publication: Erratum to ``Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs.

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