In this research, modelling of the leaves with help divisor functions are worked on. Given a positive integer k (1 ≤ 100), we investigate solutions equation σ(n) = σ(n + 2k) odd square-free n. Further, for l and prime q, there no results σ2i(n) σ2i(q). As an application, pose basic structure model real-time virtual ecosystem construction derived from shifted functions. Also, elliptic, flabellat...

We discuss the situation where a curve C, defined over a number field K, has a known K-rational divisor class of degree 1, and consider whether this class contains an actual K-rational divisor. When C has points everywhere locally, the local to global principle of the Brauer group gives the existence of such a divisor. In this situation, we give an alternative, more down to earth, approach, whi...

Let $R$ be a commutative ring and $I$ an ideal of $R$. The zero-divisor graph of $R$ with respect to $I$, denoted by $Gamma_I(R)$, is the simple graph whose vertex set is ${x in Rsetminus I mid xy in I$, for some $y in Rsetminus I}$, with two distinct vertices $x$ and $y$ are adjacent if and only if $xy in I$. In this paper, we state a relation between zero-divisor graph of $R$ with respec...

In this paper, we give infinitely many examples of (non-isomorphic) connected k-regular graphs with smallest eigenvalue in half open interval [−1− √ 2,−2) and also infinitely many examples of (non-isomorphic) connected k-regular graphs with smallest eigenvalue in half open interval [α1,−1− √ 2) where α1 is the smallest root(≈ −2.4812) of the polynomial x3 + 2x2 − 2x − 2. From these results, we ...

iv Acknowledgements v List of Tables vii List of Graphs vii

The main objective of this paper is to calculate the metric dimension and resolving-domination number zero-divisor graphs direct product finite fields. Let $F_1, \ldots, F_n(n \geqslant 2)$ be We consider graph $\Gamma(R)$ ring $R=F_1 \times \cdots F_n$ $(n determine $\beta(\Gamma(R))$ $\gamma_r(\Gamma(R))$ If order each field two, then we prove that $\beta(\Gamma(R)) \leqslant n-1$ $\gamma_r(\...

In this paper, we show that Q n is a divisor graph, for n = 2, 3. For n ≥ 4, we show that Q n is a divisor graph iff k ≥ n− 1. For folded-hypercube, we get FQn is a divisor graph when n is odd. But, if n ≥ 4 is even integer, then FQn is not a divisor graph. For n ≥ 5, we show that (FQn) k is not a divisor graph, where 2 ≤ k ≤ ⌈ 2 ⌉ − 1.

................................................................................................................................................. 3 Acknowledgements................................................................................................................................ 6 List of Tables...........................................................................................

abstract. let $l$ be a lattice with the least element $0$. an element $xin l$ is a zero divisor if $xwedge y=0$ for some $yin l^*=lsetminus left{0right}$. the set of all zero divisors is denoted by $z(l)$. we associate a simple graph $gamma(l)$ to $l$ with vertex set $z(l)^*=z(l)setminus left{0right}$, the set of non-zero zero divisors of $l$ and distinct $x,yin z(l)^*$ are adjacent if and only...