Two upper bounds for the degree distances of four sums of graphs | Zendy

Mingqiang An | Zendy; Liming Xiong | Zendy; Kinkar Ch. Das | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Two upper bounds for the degree distances of four sums of graphs

Author(s) -

Mingqiang An,

Liming Xiong,

Kinkar Ch. Das

Publication year - 2014

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/fil1403579a

Subject(s) - mathematics , combinatorics , degree (music) , vertex (graph theory) , wiener index , graph , upper and lower bounds , connectivity , discrete mathematics , mathematical analysis , physics , acoustics

The degree distance (DD), which is a weight version of the Wiener index, defined for a connected graph G as vertex-degree-weighted sum of the distances, that is, DD(G) = Σ{u,v}V(G)[dG(u)+dG(v)]d[u,v|G), where dG(u) denotes the degree of a vertex u in G and d(u,v|G) denotes the distance between two vertices u and v in G: In this paper, we establish two upper bounds for the degree distances of four sums of two graphs in terms of other indices of two individual graphs.

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