论网格图的h -不规则强度

Tensor: Pure and Applied Mathematics Journal Pub Date : 2020-05-28 DOI:10.30598/tensorvol1iss1pp1-6

M. Tilukay

{"title":"论网格图的h -不规则强度","authors":"M. Tilukay","doi":"10.30598/tensorvol1iss1pp1-6","DOIUrl":null,"url":null,"abstract":"This paper deals with three graph characteristics related to graph covering named the (vertex, edge, and total, resp.) â€“irregularity strength of a graph admitting -covering. Those are the minimum values of positive integer such that has an -irregular (vertex, edge, and total, resp.) -labeling. The exact values of this three graph characteristics are determined for grid graph admitting grid-covering,","PeriodicalId":294430,"journal":{"name":"Tensor: Pure and Applied Mathematics Journal","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On H-Irregularity Strength of Grid Graphs\",\"authors\":\"M. Tilukay\",\"doi\":\"10.30598/tensorvol1iss1pp1-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper deals with three graph characteristics related to graph covering named the (vertex, edge, and total, resp.) â€“irregularity strength of a graph admitting -covering. Those are the minimum values of positive integer such that has an -irregular (vertex, edge, and total, resp.) -labeling. The exact values of this three graph characteristics are determined for grid graph admitting grid-covering,\",\"PeriodicalId\":294430,\"journal\":{\"name\":\"Tensor: Pure and Applied Mathematics Journal\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-05-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Tensor: Pure and Applied Mathematics Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.30598/tensorvol1iss1pp1-6\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tensor: Pure and Applied Mathematics Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.30598/tensorvol1iss1pp1-6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文讨论了与图覆盖相关的三个图特征，即图允许覆盖的不规则强度(顶点、边和总等)。这些是具有不规则(顶点、边和总数等)标记的正整数的最小值。对于允许网格覆盖的网格图，确定了这三个图特征的确切值;

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

查看原文本刊更多论文

On H-Irregularity Strength of Grid Graphs

This paper deals with three graph characteristics related to graph covering named the (vertex, edge, and total, resp.) â€“irregularity strength of a graph admitting -covering. Those are the minimum values of positive integer such that has an -irregular (vertex, edge, and total, resp.) -labeling. The exact values of this three graph characteristics are determined for grid graph admitting grid-covering,

求助全文

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

来源期刊

Tensor: Pure and Applied Mathematics Journal

自引率

0.00%

发文量