Rika Yanti, Gregory Benedict Tanidi, S. Saputro, E. Baskoro
{"title":"福斯特普查中对称三次图的顶点总不规则强度","authors":"Rika Yanti, Gregory Benedict Tanidi, S. Saputro, E. Baskoro","doi":"10.19184/ijc.2022.6.2.3","DOIUrl":null,"url":null,"abstract":"Foster (1932) performed a mathematical census for all connected symmetric cubic (trivalent) graphs of order n with n ≤ 512. This census then was continued by Conder et al. (2006) and they obtained the complete list of all connected symmetric cubic graphs with order n ≤ 768. In this paper, we determine the total vertex irregularity strength of such graphs obtained by Foster. As a result, all the values of the total vertex irregularity strengths of the symmetric cubic graphs of order n from Foster census strengthen the conjecture stated by Nurdin, Baskoro, Gaos & Salman (2010), namely ⌈(n+3)/4⌉.","PeriodicalId":13506,"journal":{"name":"Indonesian Journal of Combinatorics","volume":"27 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The total vertex irregularity strength of symmetric cubic graphs of the Foster's Census\",\"authors\":\"Rika Yanti, Gregory Benedict Tanidi, S. Saputro, E. Baskoro\",\"doi\":\"10.19184/ijc.2022.6.2.3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Foster (1932) performed a mathematical census for all connected symmetric cubic (trivalent) graphs of order n with n ≤ 512. This census then was continued by Conder et al. (2006) and they obtained the complete list of all connected symmetric cubic graphs with order n ≤ 768. In this paper, we determine the total vertex irregularity strength of such graphs obtained by Foster. As a result, all the values of the total vertex irregularity strengths of the symmetric cubic graphs of order n from Foster census strengthen the conjecture stated by Nurdin, Baskoro, Gaos & Salman (2010), namely ⌈(n+3)/4⌉.\",\"PeriodicalId\":13506,\"journal\":{\"name\":\"Indonesian Journal of Combinatorics\",\"volume\":\"27 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Indonesian Journal of Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.19184/ijc.2022.6.2.3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Indonesian Journal of Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.19184/ijc.2022.6.2.3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
摘要
Foster(1932)对n≤512的所有连通的对称n阶(三价)图进行了数学普查。Conder et al.(2006)继续这个普查，他们得到了所有n阶≤768的连通对称三次图的完整列表。在本文中，我们确定了由Foster得到的这类图的顶点总不规则强度。因此，Foster人口普查的n阶对称三次图的顶点总不规则强度的所有值都加强了Nurdin, Baskoro, Gaos & Salman(2010)提出的猜想，即≤(n+3)/4≤。
The total vertex irregularity strength of symmetric cubic graphs of the Foster's Census
Foster (1932) performed a mathematical census for all connected symmetric cubic (trivalent) graphs of order n with n ≤ 512. This census then was continued by Conder et al. (2006) and they obtained the complete list of all connected symmetric cubic graphs with order n ≤ 768. In this paper, we determine the total vertex irregularity strength of such graphs obtained by Foster. As a result, all the values of the total vertex irregularity strengths of the symmetric cubic graphs of order n from Foster census strengthen the conjecture stated by Nurdin, Baskoro, Gaos & Salman (2010), namely ⌈(n+3)/4⌉.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
