一致连通图——概览

Parallel Process. Lett. Pub Date : 2020-10-12 DOI:10.1142/S0129626420400022

G. Chartrand, Ping Zhang

{"title":"一致连通图——概览","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":"{\"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}","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

摘要

对于1≤k≤n−1的整数k，如果对于G的不同顶点的每对u, v，存在一条长度为k的u - v路径，则n≥2阶的图G是k-一致连通的。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Uniformly Connected Graphs - A Survey

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...

求助全文

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

来源期刊

Parallel Process. Lett.

自引率

0.00%

发文量

期刊最新文献

A Note to Non-adaptive Broadcasting Semi-Supervised Node Classification via Semi-Global Graph Transformer Based on Homogeneity Augmentation 4-Free Strong Digraphs with the Maximum Size Relation-aware Graph Contrastive Learning The Normalized Laplacian Spectrum of Folded Hypercube with Applications