Untitled

On the generalized Wiener polarity index for some classes of graphs

“…It is enough to take g(k) = 2 + p(k − 2 + a), where a = |A i | for each integer a ≥ (k − 2) max{11, 2(p − 1)} and i = 1, ..., p with p = p − or p = p + . It follows by formula (8). This is the end of the proof.…”

“…Let p − = ⌊p⌋ and p + = ⌈p⌉ wherep is defined in (8) . We present a theorem for 2-trees of order n equal to g(k), where g(k) is some function defined in the proof.…”

“…The applications of mentioned indices are described in the papers [2,3] and also in [9,10]. Probably the best known topological index is the Wiener index and this is the one described by many authors, for example [2,8].…”

A new algorithm for computing distance matrix and Wiener index of zig-zag polyhex nanotubes

“…In this section, distance matrix and Wiener index of the graph T = TUHC 6 We now describe our algorithm to compute distance matrix of a zig-zag polyhex nanotube. To do this, we define matrices A ðaÞ mÂðn=2þ1Þ ¼ ½a ij ; B mÂðn=2þ1Þ ¼ ½b ij and A ðbÞ mÂðn=2þ1Þ ¼ ½c ij as follows: …”

“…We encourage the reader to consult Refs. [5][6][7] and references therein, for further study on the topic.…”