Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Nilesh Khandekar"'
Autor:
Nilesh Khandekar, Vinayak Joshi
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 21, Iss 3, Pp 238-248 (2024)
In this paper, we determine when the zero-divisor graph of a special class of a finite pseudocomplemented poset is Eulerian. Also, we deal with Hamiltonian, vertex pancyclic, and edge pancyclic properties of the complement of a zero-divisor graph of
Externí odkaz:
https://doaj.org/article/fdb819c35dbb4b1898aa19d7f2717380
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 21, Iss 2, Pp 143-151 (2024)
In this paper, we prove that the study of the comaximal graph of a finite commutative ring with identity is the same as the study of the zero-divisor graph of the specially constructed lattice. Also, we introduce the blow-up of a Boolean lattice usin
Externí odkaz:
https://doaj.org/article/3e1a890475374118952224b69559b4d5
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 20, Iss 3, Pp 235-243 (2023)
AbstractRecently, 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 pro
Externí odkaz:
https://doaj.org/article/ff70fdc3b1ac4cb589f8f6e03bf37509
Autor:
Vinayak Joshi, Nilesh Khandekar
Publikováno v:
Soft Computing. 24:18273-18285
In this paper, we prove that the zero-divisor graphs of a special class of pseudocomplemented posets satisfy the total coloring conjecture. Also, we determine the edge chromatic number of the zero-divisor graphs of this special class of pseudocomplem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::13c563ff06b12cb4b381fd1a264e0fdb
https://doi.org/10.1007/s00500-020-05344-2
https://doi.org/10.1007/s00500-020-05344-2