The independence number of circulant triangle-free graphs

DOI10.3934/MATH.2020242zbMath1484.05150OpenAlexW3016526705MaRDI QIDQ2129997

Yanyan Li

Publication date: 25 April 2022

Published in: AIMS Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/math.2020242

zbMATH Keywords

independence numbercirculant graphsRamsey graphsindependence ratiotriangular-free graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Triangle-free graphs whose independence number equals the degree
• Triangle-free regular graphs
• Regular \(K_n\)-free graphs
• The clique numbers of regular graphs
• Some Ramsey-Type Numbers and the Independence Ratio
• A new proof of the independence ratio of triangle-free cubic graphs

This page was built for publication: The independence number of circulant triangle-free graphs