Načítá se...
A Sufficient Condition for Graphic Sequences with Given Largest and Smallest Entries, Length, and Sum
We give a sufficient condition for a nonnegative integer list to be graphic based on its largest and smallest elements, length, and sum. This bound generalizes a result of Zverovich and Zverovich.
Uloženo v:
| Vydáno v: | Discret Math Theor Comput Sci |
|---|---|
| Hlavní autor: | |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
2018
|
| Témata: | |
| On-line přístup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6463305/ https://ncbi.nlm.nih.gov/pubmed/30996685 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.23638/DMTCS-20-1-25 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|