let $r$ be a commutative ring with identity. an ideal $i$ of a ring $r$is called an annihilating ideal if there exists $rin rsetminus {0}$ such that $ir=(0)$ and an ideal $i$ of$r$ is called an essential ideal if $i$ has non-zero intersectionwith every other non-zero ideal of $r$. thesum-annihilating essential ideal graph of $r$, denoted by $mathcal{ae}_r$, isa graph whose vertex set is the set...

in this paper, it was shown that , where  and , and , where  is not prime and , are od-characterizable.

‎let $g$ be a graph with vertex set $v(g)$ and edge set $x(g)$ and consider the set $a={0,1}$‎. ‎a mapping $l:v(g)longrightarrow a$ is called binary vertex labeling of $g$ and $l(v)$ is called the label of the vertex $v$ under $l$‎. ‎in this paper we introduce a new kind of graph energy for the binary labeled graph‎, ‎the labeled graph energy $e_{l}(g)$‎. ‎it depends on the underlying graph $g$...

We obtain a large number of degree and distance-based topological indices, graph Laplacian spectra the corresponding polynomials, entropies matching polynomials n-dimensional hypercubes through use Hadamard symmetry recursive dynamic computational techniques. Moreover, computations are used to provide independent numerical values for indices 11- 12-cubes. invoke symmetry-based transforms nD-hyp...

We investigate spectra of Cayley graphs for the Heisenberg group over Þnite rings Z/pZ, where p is a prime. Emphasis is on graphs of degree four. We show that for odd p there is only one such connected graph up to isomorphism. When p = 2, there are at most two isomorphism classes. We study the spectra using representations of the Heisenberg group. This allows us to produce histograms and butter...

a connected graph g is said to be neighbourly irregular graph if no two adjacent vertices of g have same degree. in this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.

We investigate spectra of Cayley graphs for the Heisenberg group over finite rings Z/pnZ, where p is a prime. Emphasis is on graphs of degree four. We show that for odd p there is only one such connected graph up to isomorphism. When p = 2, there are at most two isomorphism classes. We study the spectra using representations of the Heisenberg group. This allows us to produce histograms and butt...

the order graph of a group $g$, denoted by $gamma^*(g)$, is a graph whose vertices are subgroups of $g$ and two distinct vertices $h$ and $k$ are adjacent if and only if $|h|big{|}|k|$ or $|k|big{|}|h|$. in this paper, we study the connectivity and diameter of this  graph. also we give a relation between the order graph and prime  graph of a group.

There are six classes of endomorphisms for a graph. The sets these form chain under the inclusion sets. In order to systematically study endomorphisms, Böttcher and Knauer defined concepts endomorphism spectrum type graph in 1992. this paper, based on property structure monoids graphs, double-edge fan graphs described. particular, we give spectra types graphs.