Let R be a commutative ring. The annihilator graph of R, denoted by AG(R), is the undirected graph with all nonzero zero-divisors of R as vertex set, and two distinct vertices x and y are adjacent if and only if ann(xy) \neqann R(x)\cup annR(y), where for z \in R, annR(z) = {r \in R: rz = 0}. In this paper, we characterize all finite commutative rings R with planar or outerplanar or ring-graph annihilator graphs. We characterize all finite commutative rings R whose annihilator graphs have clique number 1, 2 or 3. Also, we investigate some properties of the annihilator graph under the extension of R to polynomial rings and rings of fractions. For instance, we show that the graphs AG(R) and AG(T(R)) are isomorphic, where T(R) is the total quotient ring of R. Moreover, we investigate some properties of the annihilator graph of the ring of integers modulo n, where n>1., Mojgan Afkhami, Kazem Khashyarmanesh, Zohreh Rajabi., and Obsahuje bibliografii
Let G be a graph of order n and λ(G) the spectral radius of its adjacency matrix. We extend some recent results on sufficient conditions for Hamiltonian paths and cycles in G. One of the main results of the paper is the following theorem Let k \geqslant 2,
n \geqslant k^{3} + k + 4, and let G be a graph of order n, with minimum degree δ(G) \geqslant k. If \lambda \left( G \right) \geqslant n - k - 1, then G has a Hamiltonian cycle, unless G=K_{1}\vee (K_{n-k-1}+K_{k}) or G=K_{k}\vee
(K_{n-2k}+\bar{K}_{k})., Vladimir Nikiforov., and Obsahuje seznam literatury