Hostname: page-component-848d4c4894-2xdlg Total loading time: 0 Render date: 2024-06-25T05:36:32.907Z Has data issue: false hasContentIssue false
  • English
  • Français

ON WEAKLY PERFECT ANNIHILATING-IDEAL GRAPHS

Part of: Ordered sets Graph theory

Published online by Cambridge University Press:  11 May 2021

GANESH S. KADU Open the ORCID record for GANESH S. KADU [Opens in a new window] ,
VINAYAK JOSHI Open the ORCID record for VINAYAK JOSHI [Opens in a new window]  and
SAMRUDDHA GONDE Open the ORCID record for SAMRUDDHA GONDE [Opens in a new window]
GANESH S. KADU
Affiliation:
Department of Mathematics, Savitribai Phule Pune University, Pune, India e-mail: [email protected]
VINAYAK JOSHI*
Affiliation:
Department of Mathematics, Savitribai Phule Pune University, Pune, India e-mail: [email protected]
SAMRUDDHA GONDE
Affiliation:
Indian Institute of Science Education and Research, Pune, India e-mail: [email protected]
*
e-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

We prove that the annihilating-ideal graph of a commutative semigroup with unity is, in general, not weakly perfect. This settles the conjecture of DeMeyer and Schneider [‘The annihilating-ideal graph of commutative semigroups’, J. Algebra469 (2017), 402–420]. Further, we prove that the zero-divisor graphs of semigroups with respect to semiprime ideals are weakly perfect. This enables us to produce a large class of examples of weakly perfect zero-divisor graphs from a fixed semigroup by choosing different semiprime ideals.

Keywords

annihilating-ideal graphsemigroupsemiprime idealweakly perfect graphzero-divisor graph

MSC classification

Primary: 05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
Secondary: 05C15: Coloring of graphs and hypergraphs 06A07: Combinatorics of partially ordered sets
Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 104 , Issue 3 , December 2021 , pp. 362 - 372
Check for updates
Copyright
© 2021 Australian Mathematical Publishing Association Inc.

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Anderson, D. D. and Naseer, M., ‘Beck’s coloring of a commutative ring’, J. Algebra 159 (1993), 500–514.10.1006/jabr.1993.1171CrossRefGoogle Scholar
Anderson, D. F. and Badawi, A., ‘The generalized total graph of a commutative ring’, J. Algebra Appl. 12(5) (2013), 1250212, 18 pages.CrossRefGoogle Scholar
Anderson, D. F. and LaGrange, J. D., ‘Commutative Boolean monoids, reduced rings and the compressed zero-divisor graph’, J. Pure Appl. Algebra 216 (2012), 1626–1636.CrossRefGoogle Scholar
Anderson, D. F. and Livingston, P. S., ‘The zero-divisor graph of a commutative ring’, J. Algebra 217 (1999), 434–447.CrossRefGoogle Scholar
Beck, I., ‘Coloring of a commutative ring’, J. Algebra 116 (1988), 208–226.CrossRefGoogle Scholar
Behboodi, M. and Rakeei, Z., ‘The annihilating-ideal graph of commutative rings I’, J. Algebra Appl. 10(4) (2011), 727–739.10.1142/S0219498811004896CrossRefGoogle Scholar
Behboodi, M. and Rakeei, Z., ‘The annihilating-ideal graph of commutative rings II’, J. Algebra Appl. 10(4) (2011), 741–753.CrossRefGoogle Scholar
DeMeyer, F. R., McKenzie, T. and Schneider, K., ‘The zero-divisor graph of a commutative semigroup’, Semigroup Forum 65 (2002), 206–214.CrossRefGoogle Scholar
DeMeyer, L. and Schneider, A., ‘The annihilating-ideal graph of commutative semigroups’, J. Algebra 469 (2017), 402–420.10.1016/j.jalgebra.2016.09.013CrossRefGoogle Scholar
Devhare, S., Joshi, V. and LaGrange, J., ‘On the complement of the zero-divisor graph of a partially ordered set’, Bull. Aust. Math. Soc. 97 (2018), 185–193.10.1017/S0004972717000867CrossRefGoogle Scholar
Devhare, S., Joshi, V. and LaGrange, J., ‘On the connectedness of the complement of the zero-divisor graph of a poset’, Quaest. Math. 42(7) (2019), 939–951.CrossRefGoogle Scholar
Halaš, R. and Jukl, M., ‘On Beck’s coloring of partially ordered sets’, Discrete Math. 309 (2009), 4584–4589.CrossRefGoogle Scholar
Joshi, V., ‘Zero divisor graph of a partially ordered set with respect to an ideal’, Order 29(3) (2012), 499–506.CrossRefGoogle Scholar
Joshi, V. and Sarode, S., ‘Beck’s conjecture and multiplicative lattices’, Discrete Math. 338 (2015), 93–98.10.1016/j.disc.2014.10.011CrossRefGoogle Scholar
Kist, J., ‘Minimal prime ideals in commutative semigroups’, Proc. Lond. Math. Soc. 3(13) (1963), 31–50.CrossRefGoogle Scholar
LaGrange, J., ‘Annihilators in zero-divisor graphs of semilattices and reduced commutative semigroups’, J. Pure Appl. Algebra 220 (2016), 2955–2968.10.1016/j.jpaa.2016.01.012CrossRefGoogle Scholar
LaGrange, J. and Roy, K. A., ‘Poset graphs and the lattice of graph annihilators’, Discrete Math. 313(10) (2013), 1053–1062.10.1016/j.disc.2013.02.004CrossRefGoogle Scholar
Lu, D. and Wu, T., ‘The zero-divisor graphs of partially ordered sets and an application to semigroups’, Graphs Combin. 26 (2010), 793–804.10.1007/s00373-010-0955-4CrossRefGoogle Scholar
Nimbhorkar, S. K., Wasadikar, M. P. and DeMeyer, L., ‘Coloring of semilattices’, Ars Combin. 12 (2007), 97–104.Google Scholar
Pawar, Y. S. and Thakare, N. K., ‘Minimal prime ideals in 0-distributive semilattices’, Period. Math. Hungar. 13 (1982), 237–246.10.1007/BF01849242CrossRefGoogle Scholar
Rav, Y., ‘Semiprime ideals in general lattices’, J. Pure Appl. Algebra 56 (1989), 105–118.CrossRefGoogle Scholar
Redmond, S. P., ‘The zero-divisor graph of a non-commutative ring’, Int. J. Commut. Rings 1(4) (2002), 203–211.Google Scholar
Redmond, S. P., ‘An ideal-based zero-divisor graph of a commutative ring’, Comm. Algebra 31(9) (2003), 4425–4443.10.1081/AGB-120022801CrossRefGoogle Scholar