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.

Publication Details

Journal
arXiv (Cornell University)
Published
2024-09-16
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

arXiv (Cornell University)
Advanced Graph Theory Research
article

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

article en

Abstract

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 (Cornell University)
National Natural Science Foundation of China, Science and Technology Commission of Shanghai Municipality
Openalex Percentile: Top 50%
Advanced Graph Theory Research
Open Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

The minimum size of a chordal graph with given order and minimum degree · arXiv (Cornell University) (2024) | TGRS Research Map | TGRS