Wiener-type invariants of some graph operations | Zendy

Samaneh Hossein–Zadeh | Zendy; Asma Hamzeh | Zendy; Али Реза Ашрафи | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Wiener-type invariants of some graph operations

Author(s) -

Samaneh Hossein–Zadeh,

Asma Hamzeh,

Али Реза Ашрафи

Publication year - 2009

Publication title -

filomat

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.449

H-Index - 34

eISSN - 2406-0933

pISSN - 0354-5180

DOI - 10.2298/fil0903103h

Subject(s) - wiener index , mathematics , graph , combinatorics , reciprocal , invariant (physics) , upper and lower bounds , discrete mathematics , mathematical analysis , mathematical physics , philosophy , linguistics

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) = P 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, hyper- Wiener index and Tratch-Stankevich-Zefirov index are calculated. Some upper and lower bounds are also presented.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research