{"title":"Steiner Wiener index of graph products","authors":"Yaoping Mao, Zhao Wang, I. Gutman","doi":"10.22108/TOC.2016.13499","DOIUrl":null,"url":null,"abstract":"The Wiener index $W(G)$ of a connected graph $G$ is defined as $W(G)=sum_{u,vin V(G)}d_G(u,v)$ where $d_G(u,v)$ is the distance between the vertices $u$ and $v$ of $G$. For $Ssubseteq 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 $SW_k(G)$ of $G$ is defined as $SW_k(G)=sum_{overset{Ssubseteq V(G)}{|S|=k}} d(S)$. We establish expressions for the $k$-th Steiner Wiener index on the join, corona, cluster, lexicographical product, and Cartesian product of graphs.","PeriodicalId":43837,"journal":{"name":"Transactions on Combinatorics","volume":"5 1","pages":"39-50"},"PeriodicalIF":0.6000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transactions on Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22108/TOC.2016.13499","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 22
Abstract
The Wiener index $W(G)$ of a connected graph $G$ is defined as $W(G)=sum_{u,vin V(G)}d_G(u,v)$ where $d_G(u,v)$ is the distance between the vertices $u$ and $v$ of $G$. For $Ssubseteq 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 $SW_k(G)$ of $G$ is defined as $SW_k(G)=sum_{overset{Ssubseteq V(G)}{|S|=k}} d(S)$. We establish expressions for the $k$-th Steiner Wiener index on the join, corona, cluster, lexicographical product, and Cartesian product of graphs.