关于张量积网络的Steiner k-直径的一个注记

Parallel Process. Lett. Pub Date : 2019-06-01 DOI:10.1142/S0129626419500087

Pranav Arunandhi, E. Cheng, Christopher Melekian

{"title":"关于张量积网络的Steiner k-直径的一个注记","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":"{\"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}","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

摘要

给定一个图[公式:见文]和[公式:见文]，斯坦纳距离[公式:见文]是[公式:见文]的所有连通子图(其顶点集包含[公式:见文])的最小尺寸。Steiner[公式:见文]-diameter[公式:见文]是所有[公式:见文]顶点集合中[公式:见文]的最大值。在这篇短文中，我们研究了Steiner[公式:见原文]-完全图张量积的直径。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Note on the Steiner k-Diameter of Tensor Product Networks

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Parallel Process. Lett.

自引率

0.00%

发文量