{"title":"4-不可解群的正则素数图","authors":"Donnie Munyao Kasyoki, P. Oleche","doi":"10.22108/IJGT.2019.112277.1490","DOIUrl":null,"url":null,"abstract":"Let $G$ be a finite group and $\\text{cd}(G)$ denote the character degree set for $G$. The prime graph $\\Delta(G)$ is a simple graph whose vertex set consists of prime divisors of elements in $\\text{cd}(G)$, denoted $\\rho(G)$. Two primes $p,q\\in \\rho(G)$ are adjacent in $\\Delta(G)$ if and only if $pq|a$ for some $a\\in \\text{cd}(G)$. We determine which simple 4-regular graphs occur as prime graphs for some finite nonsolvable group.","PeriodicalId":275006,"journal":{"name":"arXiv: Representation Theory","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"4-Regular prime graphs of nonsolvable groups\",\"authors\":\"Donnie Munyao Kasyoki, P. Oleche\",\"doi\":\"10.22108/IJGT.2019.112277.1490\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let $G$ be a finite group and $\\\\text{cd}(G)$ denote the character degree set for $G$. The prime graph $\\\\Delta(G)$ is a simple graph whose vertex set consists of prime divisors of elements in $\\\\text{cd}(G)$, denoted $\\\\rho(G)$. Two primes $p,q\\\\in \\\\rho(G)$ are adjacent in $\\\\Delta(G)$ if and only if $pq|a$ for some $a\\\\in \\\\text{cd}(G)$. We determine which simple 4-regular graphs occur as prime graphs for some finite nonsolvable group.\",\"PeriodicalId\":275006,\"journal\":{\"name\":\"arXiv: Representation Theory\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv: Representation Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22108/IJGT.2019.112277.1490\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv: Representation Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22108/IJGT.2019.112277.1490","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Let $G$ be a finite group and $\text{cd}(G)$ denote the character degree set for $G$. The prime graph $\Delta(G)$ is a simple graph whose vertex set consists of prime divisors of elements in $\text{cd}(G)$, denoted $\rho(G)$. Two primes $p,q\in \rho(G)$ are adjacent in $\Delta(G)$ if and only if $pq|a$ for some $a\in \text{cd}(G)$. We determine which simple 4-regular graphs occur as prime graphs for some finite nonsolvable group.