{"title":"周长为6和2(d2−d+1)顶点的正则d价图","authors":"Judith Q. Longyear","doi":"10.1016/S0021-9800(70)80095-3","DOIUrl":null,"url":null,"abstract":"<div><p>For each <em>d</em> such that <em>d</em>-1 is prime, a <em>d</em>-valent graph of girth 6 having 2(<em>d</em><sup>2</sup>−<em>d</em>+1) vertices is exhibited. The method also gives the trivalent graph of girth 8 and 30 vertices.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"9 4","pages":"Pages 420-422"},"PeriodicalIF":0.0000,"publicationDate":"1970-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80095-3","citationCount":"10","resultStr":"{\"title\":\"Regular d-valent graphs of girth 6 and 2(d2−d+1) vertices\",\"authors\":\"Judith Q. Longyear\",\"doi\":\"10.1016/S0021-9800(70)80095-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>For each <em>d</em> such that <em>d</em>-1 is prime, a <em>d</em>-valent graph of girth 6 having 2(<em>d</em><sup>2</sup>−<em>d</em>+1) vertices is exhibited. The method also gives the trivalent graph of girth 8 and 30 vertices.</p></div>\",\"PeriodicalId\":100765,\"journal\":{\"name\":\"Journal of Combinatorial Theory\",\"volume\":\"9 4\",\"pages\":\"Pages 420-422\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1970-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80095-3\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0021980070800953\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0021980070800953","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Regular d-valent graphs of girth 6 and 2(d2−d+1) vertices
For each d such that d-1 is prime, a d-valent graph of girth 6 having 2(d2−d+1) vertices is exhibited. The method also gives the trivalent graph of girth 8 and 30 vertices.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
