{"title":"On maximum Wiener index of directed grids","authors":"M. Knor, R. Škrekovski","doi":"10.26493/2590-9770.1526.2b3","DOIUrl":null,"url":null,"abstract":"This paper is devoted to Wiener index of directed graphs, more precisely of directed grids. The grid $G_{m,n}$ is the Cartesian product $P_m\\Box P_n$ of paths on $m$ and $n$ vertices, and in a particular case when $m=2$, it is a called the ladder graph $L_n$. Kraner \\v{S}umenjak et al. proved that the maximum Wiener index of a digraph, which is obtained by orienting the edges of $L_n$, is obtained when all layers isomorphic to one factor are directed paths directed in the same way except one (corresponding to an endvertex of the other factor) which is a directed path directed in the opposite way. Then they conjectured that the natural generalization of this orientation to $G_{m,n}$ will attain the maximum Wiener index among all orientations of $G_{m,n}$. In this paper we disprove the conjecture by showing that a comb-like orientation of $G_{m,n}$ has significiantly bigger Wiener index.","PeriodicalId":236892,"journal":{"name":"Art Discret. Appl. Math.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Art Discret. Appl. Math.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26493/2590-9770.1526.2b3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper is devoted to Wiener index of directed graphs, more precisely of directed grids. The grid $G_{m,n}$ is the Cartesian product $P_m\Box P_n$ of paths on $m$ and $n$ vertices, and in a particular case when $m=2$, it is a called the ladder graph $L_n$. Kraner \v{S}umenjak et al. proved that the maximum Wiener index of a digraph, which is obtained by orienting the edges of $L_n$, is obtained when all layers isomorphic to one factor are directed paths directed in the same way except one (corresponding to an endvertex of the other factor) which is a directed path directed in the opposite way. Then they conjectured that the natural generalization of this orientation to $G_{m,n}$ will attain the maximum Wiener index among all orientations of $G_{m,n}$. In this paper we disprove the conjecture by showing that a comb-like orientation of $G_{m,n}$ has significiantly bigger Wiener index.