{"title":"算术图超级边连通性数","authors":"S. Sujitha, Mary Jenitha Lazer","doi":"10.22342/jims.28.1.1032.69-74","DOIUrl":null,"url":null,"abstract":"An edge subset F of a connected graph G is a super edge cut if G − F is disconnected and every component of G−F has atleast two vertices. The minimum cardinality of super edge cut is called super edge connectivity number and it is denoted by λ'(G). Every arithmetic graph G = Vn, n not equal to p1 × p2 has super edge cut. In this paper, the authors study super edge connectivity number of an arithmetic graphs G = Vn, n = p_1^a_1 × p_2^a_2 , a1 > 1, a2 ≥ 1, and G = Vn, n = p_1^a_1 × p_2^a_2 × · · · ×p_r^a_r , r > 2, ai ≥ 1, 1 ≤ i ≤ r.","PeriodicalId":42206,"journal":{"name":"Journal of the Indonesian Mathematical Society","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2022-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Super Edge Connectivity Number of an Arithmetic Graph\",\"authors\":\"S. Sujitha, Mary Jenitha Lazer\",\"doi\":\"10.22342/jims.28.1.1032.69-74\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An edge subset F of a connected graph G is a super edge cut if G − F is disconnected and every component of G−F has atleast two vertices. The minimum cardinality of super edge cut is called super edge connectivity number and it is denoted by λ'(G). Every arithmetic graph G = Vn, n not equal to p1 × p2 has super edge cut. In this paper, the authors study super edge connectivity number of an arithmetic graphs G = Vn, n = p_1^a_1 × p_2^a_2 , a1 > 1, a2 ≥ 1, and G = Vn, n = p_1^a_1 × p_2^a_2 × · · · ×p_r^a_r , r > 2, ai ≥ 1, 1 ≤ i ≤ r.\",\"PeriodicalId\":42206,\"journal\":{\"name\":\"Journal of the Indonesian Mathematical Society\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2022-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of the Indonesian Mathematical Society\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22342/jims.28.1.1032.69-74\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the Indonesian Mathematical Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22342/jims.28.1.1032.69-74","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1
摘要
连通图G的边子集F是一个超边切，如果G−F是不连通的，并且G−F的每个分量至少有两个顶点。超边切的最小基数称为超边连通性数，用λ’(G)表示。每个算术图G = Vn, n不等于p1 × p2都有超切边。本文研究了一类算术图G = Vn, n = p_1^a_1 × p_2^a_2, a1 > 1, a2≥1，以及G = Vn, n = p_1^a_1 × p_2^a_2 ×··×p_r^a_r, r > 2, ai≥1,1≤i≤r的超边连通性数。
Super Edge Connectivity Number of an Arithmetic Graph
An edge subset F of a connected graph G is a super edge cut if G − F is disconnected and every component of G−F has atleast two vertices. The minimum cardinality of super edge cut is called super edge connectivity number and it is denoted by λ'(G). Every arithmetic graph G = Vn, n not equal to p1 × p2 has super edge cut. In this paper, the authors study super edge connectivity number of an arithmetic graphs G = Vn, n = p_1^a_1 × p_2^a_2 , a1 > 1, a2 ≥ 1, and G = Vn, n = p_1^a_1 × p_2^a_2 × · · · ×p_r^a_r , r > 2, ai ≥ 1, 1 ≤ i ≤ r.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
