{"title":"从图的适当着色得出的带符号图","authors":"Divya Antoney, Tabitha Agnes Mangam, Mukti Acharya","doi":"10.17993/3ctecno.2023.v12n2e44.148-161","DOIUrl":null,"url":null,"abstract":"Let χ(G) denote the chromatic number of a graph G. Under the proper coloring of a graph G with χ(G) colors, we define a signed graph from it. The obtained signed graph is defined as parity colored signed graph and denoted as Sc. The signs of edges of G are defined from the colors of the vertices as +( − ) if the colors on the adjacent vertices are of the same (opposite) parity. In this paper, we initiate a study on Sc. We further investigate the chromatic rna number of some classes of graphs concerning proper coloring.","PeriodicalId":143630,"journal":{"name":"3C Tecnología","volume":"95 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Signed graphs from proper coloring of graphs\",\"authors\":\"Divya Antoney, Tabitha Agnes Mangam, Mukti Acharya\",\"doi\":\"10.17993/3ctecno.2023.v12n2e44.148-161\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let χ(G) denote the chromatic number of a graph G. Under the proper coloring of a graph G with χ(G) colors, we define a signed graph from it. The obtained signed graph is defined as parity colored signed graph and denoted as Sc. The signs of edges of G are defined from the colors of the vertices as +( − ) if the colors on the adjacent vertices are of the same (opposite) parity. In this paper, we initiate a study on Sc. We further investigate the chromatic rna number of some classes of graphs concerning proper coloring.\",\"PeriodicalId\":143630,\"journal\":{\"name\":\"3C Tecnología\",\"volume\":\"95 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"3C Tecnología\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.17993/3ctecno.2023.v12n2e44.148-161\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"3C Tecnología","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17993/3ctecno.2023.v12n2e44.148-161","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Let χ(G) denote the chromatic number of a graph G. Under the proper coloring of a graph G with χ(G) colors, we define a signed graph from it. The obtained signed graph is defined as parity colored signed graph and denoted as Sc. The signs of edges of G are defined from the colors of the vertices as +( − ) if the colors on the adjacent vertices are of the same (opposite) parity. In this paper, we initiate a study on Sc. We further investigate the chromatic rna number of some classes of graphs concerning proper coloring.