Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2102.12110

Unity Product Graph of Some Commutative Rings

Mohammad Hassan Mudaber·Nor Haniza Sarmin·Ibrahim Gambo
View original source ↗Read source document ↗Export metadata ↓

Abstract

A graph is an instrument which is extensively utilized to model various problems in different fields. Up to date, many graphs have been developed to represent algebraic structures, particularly rings in order to study their properties. In this article, by focusing on commutative ring $ R $, we introduce a new notion of unity product graph associated with $ R $ and its complement. In addition, we prove that if the number of vertices of the unity product graph is at least 2, then the graph is disconnected, while its complement graph is connected. Furthermore, it is shown that there are some commutative rings with such as Boolean ring and the Cartesian product of Boolean rings in which their associated unity product graphs are trivial. Consequently, some results are established to determine the number of isolated vertices in unity product graph. We also characterize commutative rings with unity in which their associated unity product and complement unity product graphs are empty graph and complete graph, respectively. Finally, we prove some results on the properties of the unity product graph and its complement in terms of girth, diameter, radius, dominating number, chromatic number and clique number as well as planarity and Hamiltonian.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohammad Hassan Mudaber, Nor Haniza Sarmin, Ibrahim Gambo. 2021-02-24. Unity Product Graph of Some Commutative Rings. https://arxiv.org/abs/2102.12110

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO↗
arXiv2026

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO↗
arXiv2026

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO↗