四度有限拉曼图的重构

IF 1.8 Q3 AUTOMATION & CONTROL SYSTEMS

IFAC Journal of Systems and Control Pub Date : 2024-08-03 DOI:10.1016/j.ifacsc.2024.100277

Minh Hoang Trinh

{"title":"四度有限拉曼图的重构","authors":"Minh Hoang Trinh","doi":"10.1016/j.ifacsc.2024.100277","DOIUrl":null,"url":null,"abstract":"<div><p>This paper considers the problem of expanding and reducing Laman graphs, of which each vertex has at most four neighbors. To this end, several simple algorithms that can be repeatedly applied to construct or degenerate a given four-degree limited Laman graph are proposed. The correctness of the proposed algorithms is asserted based on Laman’s criterion. Numerous examples and discussions are provided to demonstrate the applicability and impact of these algorithms.</p></div>","PeriodicalId":29926,"journal":{"name":"IFAC Journal of Systems and Control","volume":"29 ","pages":"Article 100277"},"PeriodicalIF":1.8000,"publicationDate":"2024-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Reconfiguration of four-degree limited Laman graphs\",\"authors\":\"Minh Hoang Trinh\",\"doi\":\"10.1016/j.ifacsc.2024.100277\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper considers the problem of expanding and reducing Laman graphs, of which each vertex has at most four neighbors. To this end, several simple algorithms that can be repeatedly applied to construct or degenerate a given four-degree limited Laman graph are proposed. The correctness of the proposed algorithms is asserted based on Laman’s criterion. Numerous examples and discussions are provided to demonstrate the applicability and impact of these algorithms.</p></div>\",\"PeriodicalId\":29926,\"journal\":{\"name\":\"IFAC Journal of Systems and Control\",\"volume\":\"29 \",\"pages\":\"Article 100277\"},\"PeriodicalIF\":1.8000,\"publicationDate\":\"2024-08-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IFAC Journal of Systems and Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2468601824000385\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IFAC Journal of Systems and Control","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2468601824000385","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

本文探讨了拉曼图的扩展和退化问题，其中每个顶点最多有四个邻居。为此，本文提出了几种可重复应用的简单算法，以构建或退化给定的四度有限拉曼图。根据拉曼准则，可以确定所提算法的正确性。本文提供了大量示例和讨论，以证明这些算法的适用性和影响。

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

查看原文本刊更多论文

Reconfiguration of four-degree limited Laman graphs

This paper considers the problem of expanding and reducing Laman graphs, of which each vertex has at most four neighbors. To this end, several simple algorithms that can be repeatedly applied to construct or degenerate a given four-degree limited Laman graph are proposed. The correctness of the proposed algorithms is asserted based on Laman’s criterion. Numerous examples and discussions are provided to demonstrate the applicability and impact of these algorithms.

求助全文

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

来源期刊

IFAC Journal of Systems and Control AUTOMATION & CONTROL SYSTEMS-

CiteScore

3.70

自引率

5.30%

发文量