On graphs with equal coprime index and clique number

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Recently, Katre et al. introduced the concept of the coprime index of a graph. They asked to characterize the graphs for which the coprime index is the same as the clique number. In this paper, we partially solve this problem. In fact, we prove that the clique number and the coprime index of a zero-divisor graph of an ordered set and the zero-divisor graph of a ring (Formula presented.) coincide. Also, it is proved that the annihilating ideal graphs, the co-annihilating ideal graphs and the comaximal ideal graphs of commutative rings can be realized as the zero-divisor graphs of specially constructed posets. Hence the coprime index and the clique number coincide for these graphs as well.

Cite

CITATION STYLE

APA

Patil, C., Khandekar, N., & Joshi, V. (2023). On graphs with equal coprime index and clique number. AKCE International Journal of Graphs and Combinatorics, 20(3), 235–243. https://doi.org/10.1080/09728600.2023.2218442

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free