{"title":"一类直积图的超连通性","authors":"F. Soliemany, M. Ghasemi, R. Varmazyar","doi":"10.1080/23799927.2021.1974567","DOIUrl":null,"url":null,"abstract":"Let and be two graphs. The Kronecker product has vertex set and the edge set In this paper we show that if is a complete multipartite graph, where the parameters satisfying certain conditions and is a path of length n−1, then is not super i-connected, where and . Also we show that is not super connected, where is a cycle of length n and .","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2021-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Super connectivity of a family of direct product graphs\",\"authors\":\"F. Soliemany, M. Ghasemi, R. Varmazyar\",\"doi\":\"10.1080/23799927.2021.1974567\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let and be two graphs. The Kronecker product has vertex set and the edge set In this paper we show that if is a complete multipartite graph, where the parameters satisfying certain conditions and is a path of length n−1, then is not super i-connected, where and . Also we show that is not super connected, where is a cycle of length n and .\",\"PeriodicalId\":37216,\"journal\":{\"name\":\"International Journal of Computer Mathematics: Computer Systems Theory\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2021-09-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computer Mathematics: Computer Systems Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/23799927.2021.1974567\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Mathematics: Computer Systems Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/23799927.2021.1974567","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Super connectivity of a family of direct product graphs
Let and be two graphs. The Kronecker product has vertex set and the edge set In this paper we show that if is a complete multipartite graph, where the parameters satisfying certain conditions and is a path of length n−1, then is not super i-connected, where and . Also we show that is not super connected, where is a cycle of length n and .
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
