English
Related papers

Related papers: Eccentricity Spectra and Integral Eigenvalues of Z…

200 papers

The eccentricity matrix of a connected graph $G$ is obtained from the distance matrix of $G$ by retaining the largest distances in each row and each column, and setting the remaining entries as $0$. In this article, a conjecture about the…

Combinatorics · Mathematics 2020-08-18 Iswar Mahato , R. Gurusamy , M. Rajesh Kannan , S. Arockiaraj

The Zero divisor Graph of a commutative ring $R$, denoted by $\Gamma[R]$, is a graph whose vertices are non-zero zero divisors of $R$ and two vertices are adjacent if their product is zero. Chemical graph theory is a branch of mathematical…

Rings and Algebras · Mathematics 2020-01-07 B. Surendranath Reddy , Rupali S. Jain , N. Laxmikanth

Let $R$ be a commutative ring with identity and let $Z^{\ast}(R)$ denote the set of nonzero zero-divisors of $R$. The \emph{zero-divisor graph} $ \varGamma(R)$ is the simple graph with vertex set $V( \varGamma(R))=Z^{\ast}(R)$, where two…

Combinatorics · Mathematics 2026-04-06 Bilal Ahmad Rather

The eccentricity matrix of a simple connected graph is derived from its distance matrix by preserving the largest non-zero distance in each row and column, while the other entries are set to zero. This article examines the…

Combinatorics · Mathematics 2024-11-20 Anjitha Ashokan , Chithra A

We study the Laplacian eigenvalues of the zero divisor graph $\Gamma\left(\mathbb{Z}_{n}\right)$ of the ring $\mathbb{Z}_{n}$ and prove that $\Gamma\left(\mathbb{Z}_{p^t}\right)$ is Laplacian integral for every prime $p$ and positive…

Spectral Theory · Mathematics 2019-03-20 Sriparna Chattopadhyay , Kamal Lochan Patra , Binod Kumar Sahoo

The \textit{eccentricity matrix} $\mathcal{E}(G)$ of a connected graph $G$ is obtained from the distance matrix of $G$ by keeping the largest non-zero entries in each row and each column, and leaving zeros in the remaining ones. The…

Combinatorics · Mathematics 2022-04-01 Iswar Mahato , M. Rajesh Kannan

The paper systematically classifies rings based on the dominant metric dimensions (Ddim) of their associated CZDG, establishing consequential bounds for the Ddim of these compressed zero-divisor graphs. The authors investigate the interplay…

Commutative Algebra · Mathematics 2024-05-09 Nasir Ali , Hafiz Muhammad Afzal Siddiqui , Muhammad Imran Qureshi

We investigate the adjacency matrices of zero-divisor graphs derived from Lipschitz quaternion rings modulo \(n\). For odd primes \(p\), utilizing the isomorphism \(\LL_p\cong M_2(\F_p)\), we categorize vertices by kernel-image type and…

Combinatorics · Mathematics 2026-03-24 Bilal Ahmad Rather

We investigate eigenvalues of the zero-divisor graph $\Gamma(R)$ of finite commutative rings $R$ and study the interplay between these eigenvalues, the ring-theoretic properties of $R$ and the graph-theoretic properties of $\Gamma(R)$. The…

Combinatorics · Mathematics 2019-10-29 Katja Mönius

The eccentricity matrix $\epsilon(G)$, of a connected graph $G$ is obtained by retaining the maximum distance from each row and column of the distance matrix of $G$ and the other entries are assigned with 0. In this paper, we discuss the…

Combinatorics · Mathematics 2024-05-01 Anjitha Ashokan , Chithra A

In this paper, we introduce the Laplacian and the signless Laplacian for the eccentricity matrix of a connected graph, referred to as the eccentricity Laplacian and the eccentricity signless Laplacian, respectively. We establish the…

Combinatorics · Mathematics 2026-05-15 Keshav Saini , Anubha Jindal , K. Palpandi

A cograph is a simple graph that contains no induced path on four vertices. In this paper, we consider $\mathcal{C}$-graphs, which are a specific class of cographs, defined as $$\overline{\overline{\overline{K_{\alpha_{1}}}\cup…

Combinatorics · Mathematics 2025-09-23 Anjitha Ashokan , Chithra A

The eccentricity matrix of a simple connected graph G is obtained from the distance matrix of G by retaining the largest non-zero distance in each row and column, and the remaining entries are defined to be zero. A bi-block graph is a…

Combinatorics · Mathematics 2023-09-06 T. Divyadevi , I. Jeyaraman

The eccentricity matrix of a connected graph $G$, denoted by $\mathcal{E}(G)$, is obtained from the distance matrix of $G$ by keeping the largest nonzero entries in each row and each column, and leaving zeros in the remaining ones. The…

Combinatorics · Mathematics 2023-01-05 Iswar Mahato , M. Rajesh Kannan

The Zero divisor Graph of a commutative ring $R$, denoted by $\Gamma[R]$, is a graph whose vertices are non-zero zero divisors of $R$ and two vertices are adjacent if their product is zero. In this paper, we consider the zero divisor graph…

Rings and Algebras · Mathematics 2017-07-18 B. Surendranath Reddy , Rupali. S. Jain , N. Laxmikanth

The eccentricity matrix $\varepsilon(G)$ of a graph $G$ is obtained from the distance matrix of $G$ by retaining the largest distances in each row and each column, and leaving zeros in the remaining ones. The eccentricity energy of $G$ is…

Combinatorics · Mathematics 2021-07-08 Iswar Mahato , M. Rajesh Kannan

This paper is an endeavor to discuss some properties of zero-divisor graphs of the ring $\mathbb{Z}_n$, the ring of integers modulo $n$. The zero divisor graph of a commutative ring $R$, is an undirected graph whose vertices are the nonzero…

Combinatorics · Mathematics 2020-10-05 Amrita Acharyya , Robinson Czajkowski

The work in this thesis concerns the investigation of eigenvalues of the Laplacian matrix, normalized Laplacian matrix, signless Laplacian matrix and distance signless Laplacian matrix of graphs. In Chapter 1, we present a brief…

Combinatorics · Mathematics 2021-07-21 Bilal A. Rather

For a commutative ring $R,$ with non-zero zero divisors $Z^{\ast}(R)$. The zero divisor graph $\Gamma(R)$ is a simple graph with vertex set $Z^{\ast}(R)$, and two distinct vertices $x,y\in V(\Gamma(R))$ are adjacent if and only if $x\cdot…

Combinatorics · Mathematics 2024-01-17 Bilal Ahmad Rather

In this article, we discussed the zero-divisor graph of a commutative ring with identity $\mathbb{F}_p+u\mathbb{F}_p+u^2 \mathbb{F}_p$ where $u^3=0$ and $p$ is an odd prime. We find the clique number, chromatic number, vertex connectivity,…

Information Theory · Computer Science 2022-08-15 N. Annamalai
‹ Prev 1 2 3 10 Next ›