A connected ρ-regular graph G has largest eigenvalue ρ in modulus. G is called Ramanujan if it has at least 3 vertices and the second largest modulus of its eigenvalues is at most 2 √ ρ− 1. In 2010 Droll classified all Ramanujan unitary Cayley graphs. These graphs of type ICG(n, {1}) form a subset of the class of integral circulant graphs ICG(n,D), which can be characterised by their order n an...

Let G = (V, E) be a graph with p vertices and q edges. A has product-set labeling if there exist an injective function f: V(G) → P (N) such that the induced edge f∗: P(N) is defined as f∗ (μν) f (μ) ∗ (ν) ∀μ, ν ∈ E(G).f {ab: (μ), b }. In this paper we investigate how works for zero-divisor line of graphs.

The aim of this article to follow the properties zero-divisor graph special idealization ring. We study wiener index zero-divisors some ring R(+)M and find clique number Γ(R(+)M) is ω (Γ(R(+)M)) = |M| − 1, where R an integral domain. also discuss when are Hamiltonian graph.

In a manner analogous to a commutative ring, the L-ideal-based L-zero-divisor graph of a commutative ring R can be defined as the undirected graph Γ(μ) for some L-ideal μ of R. The basic properties and possible structures of the graph Γ(μ) are studied.

Abstract. A sum divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1,2,...,| ( ) |} V G such that each edge uv assigned the label 1 if 2 divides ( ) ( ) f u f v + and 0 otherwise. Further, the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph with a sum divisor cordial labeling is called a sum divisor cordial grap...

The paper studies the characterization of adjacency matrix corresponding to zero-divisor graphs of finite commutative ring of Gaussian integer under modulo „n‟. For each positive integer we calculate number of zerodivisors & examine nature of the matrix, and then we generalized the order of matrix in each case. Firstly, we have started with some example, which motivates the later results. The s...

We give necessary and sufficient conditions under which the Jacobian of a graph is generated by a divisor that is the difference of two vertices. This answers a question posed by Becker and Glass and allows us to prove various other propositions about the order of divisors that are the difference of two vertices. We conclude with some conjectures about these divisors on random graphs and suppor...

In this paper we consider, for a finite commutative ring R, the wellstudied zero-divisor graph Γ(R) and the compressed zero-divisor graph Γc(R) of R and a newly-defined graphical structure — the zero-divisor lattice Λ(R) of R. We give results which provide information when Γ(R) ∼= Γ(S), Γc(R) ∼= Γc(S), and Λ(R) ∼= Λ(S) for two finite commutative rings R and S. We also provide a theorem which sa...