Boundes for Boxicity of some classes of graphs
T. Kavaskar

TL;DR
This paper establishes bounds for the boxicity of various classes of graphs, including generalized join graphs, circular clique graphs, and zero-divisor graphs of finite rings, extending previous results and providing new inequalities.
Contribution
It introduces new bounds for the boxicity of generalized join graphs, circular clique graphs, and zero-divisor graphs of finite rings, generalizing and improving existing results.
Findings
Proved that hi(G^d_k) box(G^d_k) for all k .
Derived an upper bound for boxicity of generalized join graphs as the sum of individual boxicities.
Established bounds for boxicity of zero-divisor graphs of finite commutative rings, including exact conditions for when boxicity equals 1.
Abstract
Let be the boxicity of a graph , be the -generalized join graph of -pairwise disjoint graphs , be a circular clique graph (where ) and be the zero-divisor graph of a commutative ring . In this paper, we prove that , for all and with . This generalizes the results proved in \cite{Aki}. Also we obtain that box(G[H_1,H_2,\ldots,H_n])\leq \mathop\sum\limits_{i=1}^nbox(H_i). As a consequence of this result, we obtain a bound for boxicity of zero-divisor graph of a finite commutative ring with unity. In particular, if is a finite commutative non-zero reduced ring with unity, then . where is the chromatic number of . Moreover, we show that if $N=…
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
TopicsRings, Modules, and Algebras · Advanced Topics in Algebra
