钝化组的非线性图 Dn

Pub Date : 2024-05-14 DOI:10.22342/jims.30.1.1401.110-120

Hubbi Muhammad, Rambu Maya Imung Maharani, Sri Nurhayati, Mira Wadu, Yeni Susanti

{"title":"钝化组的非线性图 Dn","authors":"Hubbi Muhammad, Rambu Maya Imung Maharani, Sri Nurhayati, Mira Wadu, Yeni Susanti","doi":"10.22342/jims.30.1.1401.110-120","DOIUrl":null,"url":null,"abstract":"We introduce the non-braid graph of a group G, denoted by ζ(G), as a graph with vertex set G \\ B(G), where B(G) is the braider of G, defined as the set {x ∈ G | (∀y ∈ G)xyx = yxy}, and two distinct vertices x and y are joined by an edge if and only if xyx ̸ = yxy. In this paper particularly we give the independent number, the vertex chromatic number, the clique number, and the minimum vertex cover of non-braid graph of dihedral group Dn","PeriodicalId":0,"journal":{"name":"","volume":"2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"THE NON-BRAID GRAPH OF DIHEDRAL GROUP Dn\",\"authors\":\"Hubbi Muhammad, Rambu Maya Imung Maharani, Sri Nurhayati, Mira Wadu, Yeni Susanti\",\"doi\":\"10.22342/jims.30.1.1401.110-120\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce the non-braid graph of a group G, denoted by ζ(G), as a graph with vertex set G \\\\ B(G), where B(G) is the braider of G, defined as the set {x ∈ G | (∀y ∈ G)xyx = yxy}, and two distinct vertices x and y are joined by an edge if and only if xyx ̸ = yxy. In this paper particularly we give the independent number, the vertex chromatic number, the clique number, and the minimum vertex cover of non-braid graph of dihedral group Dn\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":\"2 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0,\"publicationDate\":\"2024-05-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22342/jims.30.1.1401.110-120\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22342/jims.30.1.1401.110-120","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们将群 G 的无辫图（用 ζ(G)表示）引入为具有顶点集 G\ B(G) 的图，其中 B(G) 是 G 的辫图，定义为集合 {x∈G | (∀y∈G)xyx = yxy}，并且当且仅当 xyx ̸ = yxy 时，两个不同的顶点 x 和 y 通过边连接。本文特别给出了二面角组 Dn 的非辫子图的独立数、顶点色度数、小群数和最小顶点覆盖率。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

THE NON-BRAID GRAPH OF DIHEDRAL GROUP Dn

We introduce the non-braid graph of a group G, denoted by ζ(G), as a graph with vertex set G \ B(G), where B(G) is the braider of G, defined as the set {x ∈ G | (∀y ∈ G)xyx = yxy}, and two distinct vertices x and y are joined by an edge if and only if xyx ̸ = yxy. In this paper particularly we give the independent number, the vertex chromatic number, the clique number, and the minimum vertex cover of non-braid graph of dihedral group Dn

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助