Please use this identifier to cite or link to this item:
https://scidar.kg.ac.rs/handle/123456789/11680
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.rights.license | restrictedAccess | - |
dc.contributor.author | Gutman I. | - |
dc.contributor.author | Furtula, Boris | - |
dc.contributor.author | das, kinkar | - |
dc.date.accessioned | 2021-04-20T18:57:56Z | - |
dc.date.available | 2021-04-20T18:57:56Z | - |
dc.date.issued | 2016 | - |
dc.identifier.issn | 0096-3003 | - |
dc.identifier.uri | https://scidar.kg.ac.rs/handle/123456789/11680 | - |
dc.description.abstract | © 2016 Elsevier Inc. Let G be a connected graph with vertex set V(G). For u, v ∈ V(G), d(v) and d(u, v) denote the degree of the vertex v and the distance between the vertices u and v. A much studied degree-and-distance-based graph invariant is the degree distance, defined as DD=∑{u,v}⊆V(G)[d(u)+d(v)]d(u,v). A related such invariant (usually called Gutman index) is ZZ=∑{u,v}⊆V(G)[d(u)·d(v)]d(u,v). If G is a tree, then both DD and ZZ are linearly related with the Wiener index W=∑{u,v}⊆V(G)d(u,v). We examine the difference DD-ZZ for trees and establish a number of regularities. | - |
dc.rights | info:eu-repo/semantics/restrictedAccess | - |
dc.source | Applied Mathematics and Computation | - |
dc.title | On some degree-and-distance-based graph invariants of trees | - |
dc.type | article | - |
dc.identifier.doi | 10.1016/j.amc.2016.04.040 | - |
dc.identifier.scopus | 2-s2.0-84969130561 | - |
Appears in Collections: | Faculty of Science, Kragujevac |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
PaperMissing.pdf Restricted Access | 29.86 kB | Adobe PDF | View/Open |
Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.