给定阶数和最小阶数的弦图的最小尺寸

arXiv - MATH - Combinatorics Pub Date : 2024-09-16 DOI:arxiv-2409.10261

Xingzhi Zhan, Leilei Zhang

{"title":"给定阶数和最小阶数的弦图的最小尺寸","authors":"Xingzhi Zhan, Leilei Zhang","doi":"arxiv-2409.10261","DOIUrl":null,"url":null,"abstract":"A graph is chordal if it does not contain an induced cycle of length greater\nthan three. We determine the minimum size of a chordal graph with given order\nand minimum degree. In doing so, we have discovered interesting properties of\nchordal graphs.","PeriodicalId":501407,"journal":{"name":"arXiv - MATH - Combinatorics","volume":"31 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The minimum size of a chordal graph with given order and minimum degree\",\"authors\":\"Xingzhi Zhan, Leilei Zhang\",\"doi\":\"arxiv-2409.10261\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A graph is chordal if it does not contain an induced cycle of length greater\\nthan three. We determine the minimum size of a chordal graph with given order\\nand minimum degree. In doing so, we have discovered interesting properties of\\nchordal graphs.\",\"PeriodicalId\":501407,\"journal\":{\"name\":\"arXiv - MATH - Combinatorics\",\"volume\":\"31 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.10261\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.10261","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

如果一个图不包含长度大于 3 的诱导循环，那么它就是弦图。我们确定了具有给定阶数和最小度数的弦图的最小尺寸。在此过程中，我们发现了弦图的有趣性质。

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

查看原文本刊更多论文

The minimum size of a chordal graph with given order and minimum degree

A graph is chordal if it does not contain an induced cycle of length greater than three. We determine the minimum size of a chordal graph with given order and minimum degree. In doing so, we have discovered interesting properties of chordal graphs.

求助全文

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

来源期刊

arXiv - MATH - Combinatorics

自引率

0.00%

发文量