Chromatic and Clique number of Generalized Sierpi\'{n}ski Gasket Graph $S[G,t]$
Fatemeh Attarzadeh, Ahmad Abbasi, Ali Behtoei
TL;DR
This paper investigates the chromatic and clique numbers of generalized Sierpinski graphs constructed from arbitrary simple graphs, expanding understanding of their coloring and clique properties.
Contribution
It introduces a general framework for analyzing the chromatic and clique numbers of Sierpinski graphs based on any simple base graph.
Findings
Determined bounds for the clique number.
Established bounds for the chromatic number.
Extended known results to a broader class of graphs.
Abstract
WE study the clique number and the chromatic number of generalized Sierpinski graphs in which the base graph is an arbitrary simple graph.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Advanced Combinatorial Mathematics · Advanced Graph Theory Research