{"title":"A Note on the Steiner k-Diameter of Tensor Product Networks","authors":"Pranav Arunandhi, E. Cheng, Christopher Melekian","doi":"10.1142/S0129626419500087","DOIUrl":null,"url":null,"abstract":"Given a graph [Formula: see text] and [Formula: see text], the Steiner distance [Formula: see text] is the minimum size among all connected subgraphs of [Formula: see text] whose vertex sets contain [Formula: see text]. The Steiner [Formula: see text]-diameter [Formula: see text] is the maximum value of [Formula: see text] among all sets of [Formula: see text] vertices. In this short note, we study the Steiner [Formula: see text]-diameters of the tensor product of complete graphs.","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"86 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Parallel Process. Lett.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/S0129626419500087","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Given a graph [Formula: see text] and [Formula: see text], the Steiner distance [Formula: see text] is the minimum size among all connected subgraphs of [Formula: see text] whose vertex sets contain [Formula: see text]. The Steiner [Formula: see text]-diameter [Formula: see text] is the maximum value of [Formula: see text] among all sets of [Formula: see text] vertices. In this short note, we study the Steiner [Formula: see text]-diameters of the tensor product of complete graphs.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
