Zobrazeno 1 - 10
of 248
pro vyhledávání: '"zero-divisor graphs"'
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
Autor:
Fareeha Jamal, Muhammad Imran
Publikováno v:
AIMS Mathematics, Vol 9, Iss 9, Pp 23979-23996 (2024)
In the present article, we give the distance spectrum of the zero divisor graphs of the commutative rings $ \mathbb{Z}_{t}[x]/\langle x^{4} \rangle $ ($ t $ is any prime), $ \mathbb{Z}_{t^2}[x] / \langle x^2 \rangle $ ($ t \geq 3 $ is any prime) and
Externí odkaz:
https://doaj.org/article/56c445e83786469eab43149b5fc88fed
Autor:
Nasir Ali, Hafiz Muhammad Afzal Siddiqui, Muhammad Imran Qureshi, Suhad Ali Osman Abdallah, Albandary Almahri, Jihad Asad, Ali Akgül
Publikováno v:
Symmetry, Vol 16, Iss 7, p 930 (2024)
This paper explores the concept of multiset dimensions (Mdim) of compressed zero-divisor graphs (CZDGs) associated with rings. The authors investigate the interplay between the ring-theoretic properties of a ring R and the associated compressed zero-
Externí odkaz:
https://doaj.org/article/238bd8d8a6834e0295dafa89ea8c1ce2
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:
Shakila Banu, Naveena Selvaraj
Publikováno v:
Ratio Mathematica, Vol 48, Iss 0 (2023)
A non-deterministic zero divisor graph refers to an element in a ring or algebraic structure that can multiply with another element to give zero, but the specific outcome of the multiplication is not uniquely determined. In other words, there may be
Externí odkaz:
https://doaj.org/article/44e00f2bd2764cbfafbf04a1f8681581
Autor:
N Mohamed Rilwan, A Nilofer
Publikováno v:
Ratio Mathematica, Vol 44, Iss 0, Pp 316-324 (2022)
In this paper we introduce a new labeling named as, totally magic d-lucky labeling, find the totally magic d-lucky number of some standard graphs like wheel, cycle, bigraph etc. and find the totally magic d-lucky number of some zero divisor graphs. A
Externí odkaz:
https://doaj.org/article/3b4f587f14ed4ed8ae1f9e021c69abb4
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
AIMS Mathematics, Vol 7, Iss 7, Pp 12635-12649 (2022)
For a simple connected graph $ G $ of order $ n $, the distance signless Laplacian matrix is defined by $ D^{Q}(G) = D(G) + Tr(G) $, where $ D(G) $ and $ Tr(G) $ is the distance matrix and the diagonal matrix of vertex transmission degrees, respectiv
Externí odkaz:
https://doaj.org/article/9d4de5e80b0340659d12cf91acc4ef60
Publikováno v:
Symmetry, Vol 15, Iss 10, p 1911 (2023)
The smallest set of vertices needed to differentiate or categorize every other vertex in a graph is referred to as the graph’s metric dimension. Finding the class of graphs for a particular given metric dimension is an NP-hard problem. This concept
Externí odkaz:
https://doaj.org/article/f1af72a93de24083923d4f008f07de4c
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.