30.08.2014 Views

chemia - Studia

chemia - Studia

chemia - Studia

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

STUDIA UBB. CHEMIA, LV, 4, 2010<br />

ON ESTRADA INDEX OF TWO CLASSES OF DENDRIMERS<br />

GHOLAM HOSSEIN FATH-TABAR a , ALI REZA ASHRAFI a ,<br />

ANTE GRAOVAC b,c,d<br />

ABSTRACT. Suppose G = (V, E) is a graph. The sequence v 1 v 2 …v t (v t = v 1 ) is<br />

called a closed walk with length t − 1 in G if v i 's are in V(G) and v i v i+1 ∈ E(G).<br />

In this paper, the number of closed walks with length k, C w (G,k), for two<br />

classes of denderimers are computed.<br />

Keywords: Dendrimer, closed walk. graph spectrum, Estrada index.<br />

INTRODUCTION<br />

Dendrimers are polymeric macromolecules composed of multiple<br />

perfectly-branched monomers radially emanating from a central core,<br />

Figures 1, 2. The number of branching points increases upon moving from<br />

the dendrimer core to its surface and defines dendrimer generations. They<br />

are being investigated for possible uses in nanotechnology, gene therapy,<br />

and other fields [1-5].<br />

In this paper, the word graph refers to a finite, undirected graph without<br />

loops and multiple edges. Suppose G is a graph. The vertices and edges of G<br />

are denoted by V(G) and E(G), respectively. A walk in G is an alternating<br />

sequence of graph vertices and edges such that any subsequent two edges<br />

are adjacent. A closed walk is a walk in which the first and the last vertices are<br />

the same. We encourage to the reader to consult papers [6-11] for background<br />

material, as well as basic computational techniques. Our notation is standard<br />

and mainly taken from the standard book of graph theory [12].<br />

MAIN RESULTS AND DISCUSSION<br />

Let D 1 [n] and D 2 [n] be the molecular graphs of the dendrimers depicted<br />

in Figures 1 and 2, respectively. In this section, some formulas are derived for<br />

the number of closed walks of length k, C w (G,k), where 1 ≤ k ≤ 10 and G is<br />

one of the molecular graphs D 1 [n] and D 2 [n]. For the sake of completeness,<br />

we mention here a well-known theorem in algebraic graph theory as follows:<br />

a Department of Mathematics, Statistics and Computer Science, Faculty of Science,University of<br />

Kashan, Kashan 87317-51167, I. R. Iran<br />

b Faculty of Science, University of Split, Nikole Tesle 12, HR-21000, Split, Croatia<br />

c NMR Center, Institute »R. Boskovic«, HR-10002 Zagreb, POB 180, Croatia<br />

d IMC, University of Dubrovnik, Branitelja Dubrovnika 29, HR-20000 Dubrovnik, Croatia

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!