{"title":"论有限可解群的轨道正则图","authors":"Karnika Sharma, Vijay Kumar Bhat, P. Singh","doi":"10.61091/um118-02","DOIUrl":null,"url":null,"abstract":"Let G be a finite solvable group and Δ be the subset of Υ×Υ, where Υ is the set of all pairs of size two commuting elements in G. If G operates on a transitive G – space by the action (υ1,υ2)g=(υg1,υg2); υ1,υ2∈Υ and g∈G, then orbits of G are called orbitals. The subset Δo={(υ,υ);υ∈Υ,(υ,υ)∈Υ×Υ} represents G′s diagonal orbital.The orbital regular graph is a graph on which G acts regularly on the vertices and the edge set. In this paper, we obtain the orbital regular graphs for some finite solvable groups using a regular action. Furthermore, the number of edges for each of a group’s orbitals is obtained.","PeriodicalId":49389,"journal":{"name":"Utilitas Mathematica","volume":"211 4","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Orbital Regular Graph of Finite Solvable Groups\",\"authors\":\"Karnika Sharma, Vijay Kumar Bhat, P. Singh\",\"doi\":\"10.61091/um118-02\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let G be a finite solvable group and Δ be the subset of Υ×Υ, where Υ is the set of all pairs of size two commuting elements in G. If G operates on a transitive G – space by the action (υ1,υ2)g=(υg1,υg2); υ1,υ2∈Υ and g∈G, then orbits of G are called orbitals. The subset Δo={(υ,υ);υ∈Υ,(υ,υ)∈Υ×Υ} represents G′s diagonal orbital.The orbital regular graph is a graph on which G acts regularly on the vertices and the edge set. In this paper, we obtain the orbital regular graphs for some finite solvable groups using a regular action. Furthermore, the number of edges for each of a group’s orbitals is obtained.\",\"PeriodicalId\":49389,\"journal\":{\"name\":\"Utilitas Mathematica\",\"volume\":\"211 4\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-01-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Utilitas Mathematica\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.61091/um118-02\",\"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":"Utilitas Mathematica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.61091/um118-02","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0
摘要
如果 G 通过作用 (υ1,υ2)g=(υg1,υg2); υ1,υ2∈Υ 和 g∈G 作用于传递 G - 空间,那么 G 的轨道称为轨道。子集 Δo={(υ,υ);υ∈Υ,(υ,υ)∈Υ×Υ} 表示 G′的对角轨道。轨道正则图是 G 规则地作用于顶点和边集的图。本文利用正则作用得到了一些有限可解群的轨道正则图。此外,我们还得到了每个群轨道的边数。
On the Orbital Regular Graph of Finite Solvable Groups
Let G be a finite solvable group and Δ be the subset of Υ×Υ, where Υ is the set of all pairs of size two commuting elements in G. If G operates on a transitive G – space by the action (υ1,υ2)g=(υg1,υg2); υ1,υ2∈Υ and g∈G, then orbits of G are called orbitals. The subset Δo={(υ,υ);υ∈Υ,(υ,υ)∈Υ×Υ} represents G′s diagonal orbital.The orbital regular graph is a graph on which G acts regularly on the vertices and the edge set. In this paper, we obtain the orbital regular graphs for some finite solvable groups using a regular action. Furthermore, the number of edges for each of a group’s orbitals is obtained.
期刊介绍:
Utilitas Mathematica publishes papers in all areas of statistical designs and combinatorial mathematics, including graph theory, design theory, extremal combinatorics, enumeration, algebraic combinatorics, combinatorial optimization, Ramsey theory, automorphism groups, coding theory, finite geometries, chemical graph theory, etc., as well as the closely related area of number-theoretic polynomials for enumeration.