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

DOI10.3934/amc.2009.3.97zbMath1193.05158OpenAlexW2094349341MaRDI QIDQ2268243

David Auger, Irène Charon, Olivier Hudry, Iiro S. Honkala, Antoine C. Lobstein

Publication date: 10 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.97

zbMATH Keywords

graph theorydiameterminimum degreeradiusmaximum independent setidentifying codemaximum stable settwinstwin-free graphidentifiable graph

Mathematics Subject Classification ID

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

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