{"title":"Uniformly Connected Graphs - A Survey","authors":"G. Chartrand, Ping Zhang","doi":"10.1142/S0129626420400022","DOIUrl":null,"url":null,"abstract":"A graph G of order n ≥ 2 is k-uniformly connected for an integer k with 1 ≤ k ≤ n − 1 if for every pair u, v of distinct vertices of G, there is a u − v path of length k. A number of results, conje...","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-12","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/S0129626420400022","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
A graph G of order n ≥ 2 is k-uniformly connected for an integer k with 1 ≤ k ≤ n − 1 if for every pair u, v of distinct vertices of G, there is a u − v path of length k. A number of results, conje...
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
