图接近诚恳度的度量

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics Pub Date : 2025-03-28 DOI:10.1016/j.dam.2025.03.012

Anand Brahmbhatt , Kartikeya Rai , Amitabha Tripathi

{"title":"图接近诚恳度的度量","authors":"Anand Brahmbhatt , Kartikeya Rai , Amitabha Tripathi","doi":"10.1016/j.dam.2025.03.012","DOIUrl":null,"url":null,"abstract":"<div><div>A graph <span><math><mi>G</mi></math></span> is cordial if there exists a function <span><math><mi>f</mi></math></span> from the vertices of <span><math><mi>G</mi></math></span> to <span><math><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>}</mo></mrow></math></span> such that the number of vertices labelled 0 and the number of vertices labelled 1 differ by at most 1, and if we assign to each edge <span><math><mrow><mi>x</mi><mi>y</mi></mrow></math></span> the label <span><math><mrow><mo>|</mo><mi>f</mi><mrow><mo>(</mo><mi>x</mi><mo>)</mo></mrow><mo>−</mo><mi>f</mi><mrow><mo>(</mo><mi>y</mi><mo>)</mo></mrow><mo>|</mo></mrow></math></span>, the number of edges labelled 0 and the number of edges labelled 1 also differ at most by 1. We introduce two measures of how close a graph is to being cordial, and compute these measures for a variety of classes of graphs.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"370 ","pages":"Pages 157-166"},"PeriodicalIF":1.0000,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Measures of closeness to cordiality for graphs\",\"authors\":\"Anand Brahmbhatt , Kartikeya Rai , Amitabha Tripathi\",\"doi\":\"10.1016/j.dam.2025.03.012\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>A graph <span><math><mi>G</mi></math></span> is cordial if there exists a function <span><math><mi>f</mi></math></span> from the vertices of <span><math><mi>G</mi></math></span> to <span><math><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>}</mo></mrow></math></span> such that the number of vertices labelled 0 and the number of vertices labelled 1 differ by at most 1, and if we assign to each edge <span><math><mrow><mi>x</mi><mi>y</mi></mrow></math></span> the label <span><math><mrow><mo>|</mo><mi>f</mi><mrow><mo>(</mo><mi>x</mi><mo>)</mo></mrow><mo>−</mo><mi>f</mi><mrow><mo>(</mo><mi>y</mi><mo>)</mo></mrow><mo>|</mo></mrow></math></span>, the number of edges labelled 0 and the number of edges labelled 1 also differ at most by 1. We introduce two measures of how close a graph is to being cordial, and compute these measures for a variety of classes of graphs.</div></div>\",\"PeriodicalId\":50573,\"journal\":{\"name\":\"Discrete Applied Mathematics\",\"volume\":\"370 \",\"pages\":\"Pages 157-166\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2025-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Applied Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0166218X25001362\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X25001362","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

摘要

如果存在一个函数f，从G的顶点到{0,1}，使得标记为0的顶点的数目和标记为1的顶点的数目相差不超过1，那么图G是诚恳的，并且如果我们给每条边xy分配标记为|f(x)−f(y)|，标记为0的边的数目和标记为1的边的数目也相差不超过1。我们介绍了图与亲切的接近程度的两个度量，并计算了各种图类的这些度量。

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

查看原文本刊更多论文

Measures of closeness to cordiality for graphs

A graph

G

is cordial if there exists a function

f

from the vertices of

G

{0, 1}

such that the number of vertices labelled 0 and the number of vertices labelled 1 differ by at most 1, and if we assign to each edge

x y

the label

| f (x) - f (y) |

, the number of edges labelled 0 and the number of edges labelled 1 also differ at most by 1. We introduce two measures of how close a graph is to being cordial, and compute these measures for a variety of classes of graphs.

求助全文

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

来源期刊

Discrete Applied Mathematics 数学-应用数学

CiteScore

2.30

自引率

9.10%

发文量

422

审稿时长

4.5 months

期刊介绍： The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal. Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.