We consider diffusion-limited annihilating systems with mobile A-particles and stationary B-particles placed throughout a graph. Mutual annihilation occurs whenever an A-particle meets B-particle. Such systems, when ran in discrete time, are also referred to as parking processes. show for broad family of graphs random walk kernels that augmenting either the size or variability initial placement...

The second Zagreb coindex is a well-known graph invariant defined as the total degree product of all non-adjacent vertex pairs in a graph. The second Zagreb eccentricity coindex is defined analogously to the second Zagreb coindex by replacing the vertex degrees with the vertex eccentricities. In this paper, we present exact expressions or sharp lower bounds for the second Zagreb eccentricity co...

let $m$ be a module over a commutative ring $r$ and let $n$ be a proper submodule of $m$. the total graph of $m$ over $r$ with respect to $n$, denoted by $t(gamma_{n}(m))$, have been introduced and studied in [2]. in this paper, a generalization of the total graph $t(gamma_{n}(m))$, denoted by $t(gamma_{n,i}(m))$ is presented, where $i$ is an ideal of $r$. it is the graph with all elements of $...

let g be a molecular graph. the wiener index of g is defined as the summation of alldistances between vertices of g. in this paper, an exact formula for the wiener index of a newtype of nanostar dendrimer is given.