Cargando…
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.
Autor principal: | Cloteaux, Brian |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6463305/ https://www.ncbi.nlm.nih.gov/pubmed/30996685 http://dx.doi.org/10.23638/DMTCS-20-1-25 |
Ejemplares similares
-
Conference on From the Smallest to the Largest Distances
Publicado: (2001) -
Dark Matter 2018: From the Smallest to the Largest Scales
Publicado: (2018) -
Dark Matter 2016: From the smallest to the largest scales
Publicado: (2016) -
The Smallest Spectral Radius of Graphs with a Given Clique Number
por: Zhang, Jing-Ming, et al.
Publicado: (2014) -
Imaging single-cell blood flow in the smallest to largest vessels in the living retina
por: Joseph, Aby, et al.
Publicado: (2019)