全路径凸性：两个特征、一般位置数和一种算法

IF 1 Q1 MATHEMATICS

Discrete Mathematics Letters Pub Date : 2024-04-05 DOI:10.47443/dml.2024.014

{"title":"全路径凸性：两个特征、一般位置数和一种算法","authors":"","doi":"10.47443/dml.2024.014","DOIUrl":null,"url":null,"abstract":"We present two characterizations for the all-path convex sets in graphs. Using the ﬁrst criterion, we obtain a new characterization of connected block graphs and compute the general position number in a graph with respect to the all-path convexity. The second criterion allows us to provide a new algorithm for testing a set on all-path convexity.","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2024-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"All-path convexity: two characterizations, general position number, and one algorithm\",\"authors\":\"\",\"doi\":\"10.47443/dml.2024.014\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present two characterizations for the all-path convex sets in graphs. Using the ﬁrst criterion, we obtain a new characterization of connected block graphs and compute the general position number in a graph with respect to the all-path convexity. The second criterion allows us to provide a new algorithm for testing a set on all-path convexity.\",\"PeriodicalId\":36023,\"journal\":{\"name\":\"Discrete Mathematics Letters\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2024-04-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.47443/dml.2024.014\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics Letters","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47443/dml.2024.014","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

我们提出了图中全路径凸集的两个特征。利用第一个标准，我们获得了连通块图的新特征，并计算了图中与全路径凸性有关的一般位置数。第二个标准使我们能够提供一种新算法，用于测试全路径凸集。

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

查看原文本刊更多论文

All-path convexity: two characterizations, general position number, and one algorithm

We present two characterizations for the all-path convex sets in graphs. Using the ﬁrst criterion, we obtain a new characterization of connected block graphs and compute the general position number in a graph with respect to the all-path convexity. The second criterion allows us to provide a new algorithm for testing a set on all-path convexity.

求助全文

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

来源期刊

Discrete Mathematics Letters Mathematics-Discrete Mathematics and Combinatorics

CiteScore

1.50

自引率

12.50%

发文量

审稿时长

12 weeks