let $g$ be a simple graph with vertex set $v(g) = {v_1, v_2,ldots, v_n}$ and edge set $e(g) = {e_1, e_2,ldots , e_m}$. similar tothe randi'c matrix, here we introduce the randi'c incidence matrixof a graph $g$, denoted by $i_r(g)$, which is defined as the$ntimes m$ matrix whose $(i, j)$-entry is $(d_i)^{-frac{1}{2}}$ if$v_i$ is incident to $e_j$ and $0$ otherwise. naturally, therandi'c incidenc...

In this paper an algorithm for computing the Balaban and Randic indices of any simple connected graph was introduced. Also these indices were computed for IPR C80 fullerene isomers, Zigzag nanotubes and graphene by GAP program.

3 Randic M, Miletic V. Depressant actions of methionine-enkephalin and somatostatin in cat dorsal horn neurones activated by noxious stimuli. Brain Res 1978;152:196-202. 4 Hokfelt T, Kellerth JO, Nilsson G, Pernow B. Experimental immunohistochemical studies on the localization and distribution of substance P in cat primary sensory neurones. Brain Res 1975;100:235-52. 5 Takagi H, Shiomi H, Fukui...

It is necessary to generate the automorphism group of a chemical graph in computer-aided structure elucidation. An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for i≠j, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce...

the relationship between the randic , wiener, hosoya , balaban, schultz indices, harary numbers anddistance matrix to enthalpies of formation (airf), heat capacity, (cp) , enthalpies of combustion (ah °c ),enthalpy of vaporization (ah °vap) and normal boiling points (bpk)of c2 c10 normal alkanes isrepresented

The relationship between the Randic , Wiener, Hosoya , Balaban, Schultz indices, Harary numbers andDistance matrix to enthalpies of formation (Airf), heat capacity, (Cp) , enthalpies of combustion (AH °c ),enthalpy of vaporization (AH °vap) and normal boiling points (bpK)of C2 C10 normal alkanes isrepresented

Sierpinski graphs are a widely observed family of fractal-type relevant to topology, Hanoi Tower mathematics, computer engineering, and around. Chemical implementations graph theory establish significant properties, such as chemical activity, physicochemical thermodynamic pharmacological activities molecular graph. Specific descriptors alluded topological indices helpful predict these propertie...

By the Von Neumann regular graph of R, we mean the graph that its vertices are all elements of R such that there is an edge between vertices x,y if and only if x+y is a von Neumann regular element of R, denoted by G_Vnr (R). For a commutative ring R with unity, x in R is called Von Neumann regular if there exists x in R such that a=a2 x. We denote the set of Von Neumann regular elements by V nr...

AIM To assess the topographical relation between gastric glands, using the minimum spanning tree (MST), to derive both a model of neighbourhood and quantitative representation of the tissue's architecture, to assess the characteristic features of gastric atrophy, and to assess the grades of gastric atrophy. METHODS Haematoxylin and eosin stained sections from corporal and antral biopsy specim...