How Much Regularity Forces a Sequence to be Graphic?
Brian Cloteaux
Abstract
Open-access reader
Brian Cloteaux
Abstract
Open-access reader
For an integer sequence (with even sum), the closer that the sequence is to being regular, the more likely that the sequence is graphic. But how regular must a sequence be before it must always be graphic? We show that for many sequences if all values are within $\frac{n-2}{4}$ of the mean degree value, then the sequence is graphic. We also see how this result extends to show when a maximum difference between sequence values implies that a sequence is graphic.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
For an integer sequence (with even sum), the closer that the sequence is to being regular, the more likely that the sequence is graphic. But how regular must a sequence be before it must always be graphic? We show that for many sequences if all values are within $\frac{n-2}{4}$ of the mean degree value, then the sequence is graphic. We also see how this result extends to show when a maximum difference between sequence values implies that a sequence is graphic.
Key concepts: Sequence (biology), Value (mathematics), Combinatorics, Integer (computer science), Mathematics, Computer science, Statistics, Biology