1. University of Kragujevac Digital Archive
  2. University of Kragujevac
  3. Faculty of Science, Kragujevac
Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/11905
Full metadata record
DC FieldValueLanguage
dc.rights.licenserestrictedAccess-
dc.contributor.authorMao Y.-
dc.contributor.authorWang Z.-
dc.contributor.authorGutman, Ivan-
dc.date.accessioned2021-04-20T19:31:32Z-
dc.date.available2021-04-20T19:31:32Z-
dc.date.issued2016-
dc.identifier.issn2251-8657-
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/11905-
dc.description.abstract© 2016. University of Isfahan. All rights reserved. The Wiener index W (G) of a connected graph G is defined as (Presented formula) where dG (u, v) is the distance between the vertices u and v of G. For S ⊆ V (G), the Steiner distance d (S) of the vertices of S is the minimum size of a connected subgraph of G whose vertex set is S. The k-th Steiner Wiener index SWk (G) of G is defined as (Presented formula). We establish expressions for the k-th Steiner Wiener index on the join, corona, cluster, lexicographical product, and Cartesian product of graphs-
dc.rightsinfo:eu-repo/semantics/restrictedAccess-
dc.sourceTransactions on Combinatorics-
dc.titleSteiner wiener index of graph products-
dc.typearticle-
dc.identifier.doi10.22108/toc.2016.13499-
dc.identifier.scopus2-s2.0-85009859059-
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)

441

Downloads(s)

12

Files in This Item:
File Description SizeFormat 
PaperMissing.pdf
  Restricted Access		29.86 kBAdobe PDFThumbnail
View/Open
Show simple item record


Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.