The Generalized Wiener Polarity Index of some Graph Operations

Authors

  • F. WEI South China Agricultural University, P. R. China
  • Y. WU South China Agricultural University, P. R. China
  • Z. JIA South China Agricultural University, P. R. China
Abstract:

Let G be a simple connected graph. The generalized polarity Wiener index of G is defined as the number of unordered pairs of vertices of G whose distance is k. Some formulas are obtained for computing the generalized polarity Wiener index of the Cartesian product and the tensor product of graphs in this article.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

the generalized wiener polarity index of some graph operations

let g be a simple connected graph. the generalized polarity wiener index ofg is defined as the number of unordered pairs of vertices of g whosedistance is k. some formulas are obtained for computing the generalizedpolarity wiener index of the cartesian product and the tensor product ofgraphs in this article.

full text

Remarks on the Wiener Polarity Index of Some Graph Operations†

TheWiener polarity indexWp(G) of a graphG of order n is the number of unordered pairs of vertices u and v of G such that the distance dG(u, v) between u and v is 3. In this paper the Wiener polarity index of some graph operations are computed. As an application of our results, the Wiener polarity index of a polybuckyball fullerene and C4 nanotubes and nanotori are computed. AMS Mathematics Subj...

full text

The modified Wiener index of some graph operations

Graovac and Pisanski [On the Wiener index of a graph, J. Math. Chem. 8 (1991) 53 – 62] applied an algebraic approach to generalize the Wiener index by symmetry group of the molecular graph under consideration. In this paper, exact formulas for this graph invariant under some graph operations are presented.

full text

Computing GA4 Index of Some Graph Operations

The geometric-arithmetic index is another topological index was defined as 2 deg ( )deg ( ) ( ) deg ( ) deg ( ) G G uv E G G u v GA G u v     , in which degree of vertex u denoted by degG (u). We now define a new version of GA index as 4 ( ) 2 ε ( )ε ( ) ( ) ε ( ) ε ( ) G G e uv E G G G u v GA G   u v    , where εG(u) is the eccentricity of vertex u. In this paper we compute this new t...

full text

The hyper-Wiener index of graph operations

Let G be a graph. The distance d(u,v) between the vertices u and v of the graph G is equal to the length of a shortest path that connects u and v. The Wiener index W(G) is the sum of all distances between vertices of G, whereas the hyper-Wiener index WW(G) is defined as WW(G)=12W(G)+12@?"{"u","v"}"@?"V"("G")d (u,v)^2. In this paper the hyper-Wiener indices of the Cartesian product, composition,...

full text

Wiener - Type Invariants of Some Graph Operations ∗

Let d(G, k) be the number of pairs of vertices of a graph G that are at distance k, λ a real number, and Wλ(G) = ∑ k≥1 d(G, k)kλ. Wλ(G) is called the Wiener-type invariant of G associated to real number λ. In this paper, the Wiener-type invariants of some graph operations are computed. As immediate consequences, the formulae for reciprocal Wiener index, Harary index, hyperWiener index and Tratc...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 4  issue 2

pages  177- 183

publication date 2013-05-01

{@ msg @}

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023