The independence number of circulant triangle-free graphs

DOI10.3934/MATH.2020242MaRDI QIDQ2129997zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 25 April 2022

Published in AIMS Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

circulant graphsindependence numberindependence ratioRamsey graphstriangular-free graphs

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(8)

• A note on the independence number of triangle-free graphs. II
• Triangle-free graphs with large independent domination number
• The independence numbers of weighted graphs with forbidden cycles
• scientific article; zbMATH DE number 5671263 (Why is no real title available?)
• scientific article; zbMATH DE number 1151823 (Why is no real title available?)
• On the number of independent sets in cycle-separated tricyclic graphs
• Independent arithmetic progressions in clique-free graphs on the natural numbers
• 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

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