无限正方形网格和无限六边形网格的诱导分解

Q3 Mathematics

Ural Mathematical Journal Pub Date : 2022-07-29 DOI:10.15826/umj.2022.1.003

D. Deepthy, J. Kureethara

{"title":"无限正方形网格和无限六边形网格的诱导分解","authors":"D. Deepthy, J. Kureethara","doi":"10.15826/umj.2022.1.003","DOIUrl":null,"url":null,"abstract":"The induced \\(nK_2\\) decomposition of infinite square grids and hexagonal grids are described here. We use the multi-level distance edge labeling as an effective technique in the decomposition of square grids. If the edges are adjacent, then their color difference is at least 2 and if they are separated by exactly a single edge, then their colors must be distinct. Only non-negative integers are used for labeling. The proposed partitioning technique per the edge labels to get the induced \\(nK_2\\) decomposition of the ladder graph is the square grid and the hexagonal grid.","PeriodicalId":36805,"journal":{"name":"Ural Mathematical Journal","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"INDUCED \\\\(nK_{2}\\\\) DECOMPOSITION OF INFINITE SQUARE GRIDS AND INFINITE HEXAGONAL GRIDS\",\"authors\":\"D. Deepthy, J. Kureethara\",\"doi\":\"10.15826/umj.2022.1.003\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The induced \\\\(nK_2\\\\) decomposition of infinite square grids and hexagonal grids are described here. We use the multi-level distance edge labeling as an effective technique in the decomposition of square grids. If the edges are adjacent, then their color difference is at least 2 and if they are separated by exactly a single edge, then their colors must be distinct. Only non-negative integers are used for labeling. The proposed partitioning technique per the edge labels to get the induced \\\\(nK_2\\\\) decomposition of the ladder graph is the square grid and the hexagonal grid.\",\"PeriodicalId\":36805,\"journal\":{\"name\":\"Ural Mathematical Journal\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-07-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ural Mathematical Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15826/umj.2022.1.003\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ural Mathematical Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15826/umj.2022.1.003","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 0

摘要

本文描述了无限平方网格和六边形网格的诱导\(nK_2\)分解。我们将多级距离边缘标记作为一种有效的方形网格分解技术。如果这两条边是相邻的，那么它们的色差至少是2，如果它们只被一条边分开，那么它们的颜色必须是不同的。只有非负整数用于标记。提出了根据边缘标签对梯形图进行诱导分解\(nK_2\)的划分技术，即正方形网格和六边形网格。

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

查看原文本刊更多论文

INDUCED \(nK_{2}\) DECOMPOSITION OF INFINITE SQUARE GRIDS AND INFINITE HEXAGONAL GRIDS

The induced \(nK_2\) decomposition of infinite square grids and hexagonal grids are described here. We use the multi-level distance edge labeling as an effective technique in the decomposition of square grids. If the edges are adjacent, then their color difference is at least 2 and if they are separated by exactly a single edge, then their colors must be distinct. Only non-negative integers are used for labeling. The proposed partitioning technique per the edge labels to get the induced \(nK_2\) decomposition of the ladder graph is the square grid and the hexagonal grid.

求助全文

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

来源期刊

Ural Mathematical Journal Mathematics-Mathematics (all)

CiteScore

1.30

自引率

0.00%

发文量

审稿时长

16 weeks