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

DOI10.3934/AMC.2009.3.97zbMATH Open1193.05158OpenAlexW2094349341MaRDI QIDQ2268243FDOQ2268243

Authors: David Auger, Irène Charon, Olivier Hudry, Iiro Honkala, Antoine 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

Recommendations

• Extremal values for the maximum degree in a twin-free graph.
• Extremal values for identification, domination and maximum cliques in twin-free graphs.
• Structural properties of twin-free graphs
• Induced paths in twin-free graphs
• On the existence of a cycle of length at least 7 in a \((1,\leq 2)\)-twin-free graph

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 (2)

• On Iiro Honkala's contributions to identifying codes
• Rank and chromatic number of a graph

This page was built for publication: 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 Q2268243)