{"title":"焦饼图和高丹图的广义3连通性","authors":"Jing Wang, Zuozheng Zhang, Yuanqiu Huang","doi":"10.1080/09728600.2023.2212293","DOIUrl":null,"url":null,"abstract":"The generalized $k$-connectivity of a graph $G$, denoted by $\\kappa_k(G)$, is the minimum number of internally edge disjoint $S$-trees for any $S\\subseteq V(G)$ and $|S|=k$. The generalized $k$-connectivity is a natural extension of the classical connectivity and plays a key role in applications related to the modern interconnection networks. The burnt pancake graph $BP_n$ and the godan graph $EA_n$ are two kinds of Cayley graphs which posses many desirable properties. In this paper, we investigate the generalized 3-connectivity of $BP_n$ and $EA_n$. We show that $\\kappa_3(BP_n)=n-1$ and $\\kappa_3(EA_n)=n-1$.","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":" ","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2022-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The generalized 3-connectivity of burnt pancake graphs and godan graphs\",\"authors\":\"Jing Wang, Zuozheng Zhang, Yuanqiu Huang\",\"doi\":\"10.1080/09728600.2023.2212293\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The generalized $k$-connectivity of a graph $G$, denoted by $\\\\kappa_k(G)$, is the minimum number of internally edge disjoint $S$-trees for any $S\\\\subseteq V(G)$ and $|S|=k$. The generalized $k$-connectivity is a natural extension of the classical connectivity and plays a key role in applications related to the modern interconnection networks. The burnt pancake graph $BP_n$ and the godan graph $EA_n$ are two kinds of Cayley graphs which posses many desirable properties. In this paper, we investigate the generalized 3-connectivity of $BP_n$ and $EA_n$. We show that $\\\\kappa_3(BP_n)=n-1$ and $\\\\kappa_3(EA_n)=n-1$.\",\"PeriodicalId\":48497,\"journal\":{\"name\":\"AKCE International Journal of Graphs and Combinatorics\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2022-11-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AKCE International Journal of Graphs and Combinatorics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1080/09728600.2023.2212293\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AKCE International Journal of Graphs and Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1080/09728600.2023.2212293","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1
摘要
图$G$的广义$k$-连通性,用$\kappa_k(G)$表示,是任意$S\subseteq V(G)$和$|S|=k$的内部边不相交$S$-树的最小个数。广义连通性是经典连通性的自然延伸,在现代互联网络的应用中起着关键作用。烧饼图BP_n和大饼图EA_n是两种具有许多理想性质的Cayley图。本文研究了$BP_n$和$EA_n$的广义3连通性。我们表明,美元\ kappa_3 (BP_n) = n - 1 $和$ \ kappa_3 (EA_n) = n - 1美元。
The generalized 3-connectivity of burnt pancake graphs and godan graphs
The generalized $k$-connectivity of a graph $G$, denoted by $\kappa_k(G)$, is the minimum number of internally edge disjoint $S$-trees for any $S\subseteq V(G)$ and $|S|=k$. The generalized $k$-connectivity is a natural extension of the classical connectivity and plays a key role in applications related to the modern interconnection networks. The burnt pancake graph $BP_n$ and the godan graph $EA_n$ are two kinds of Cayley graphs which posses many desirable properties. In this paper, we investigate the generalized 3-connectivity of $BP_n$ and $EA_n$. We show that $\kappa_3(BP_n)=n-1$ and $\kappa_3(EA_n)=n-1$.
期刊介绍:
AKCE International Journal of Graphs and Combinatorics is devoted to publication of standard original research papers in Combinatorial Mathematics and related areas. The fields covered by the journal include: Graphs and hypergraphs, Network theory, Combinatorial optimization, Coding theory, Block designs, Combinatorial geometry, Matroid theory, Logic, Computing, Neural networks and any related topics. Each volume will consist of three issues to be published in the months of April, August and December every year. Contribution presented to the journal can be Full-length article, Review article, Short communication and about a conference. The journal will also publish proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standard of the journal.