Chromatic and Clique number of Generalized Sierpi\'nski Gasket Graph S[G,t]
Abstract
WE study the clique number and the chromatic number of generalized Sierpinski graphs in which the base graph is an arbitrary simple graph.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.