A carregar...
Minimum-Loop Realization of Degree Sequences
Given a finite sequence D of nonnegative integers, let M(D) denote its maximum element and S(D) its sum. It is known that D is realizable as a degree sequence by some graph if and only if S(D) is even, and by a loopless graph if and only if the even integer S(D) − 2M(D) ⩾ 0. Here it is shown that if...
Na minha lista:
| Publicado no: | J Res Natl Bur Stand (1977) |
|---|---|
| Main Authors: | , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
National Institute of Standards and Technology
1982
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6706547/ https://ncbi.nlm.nih.gov/pubmed/34566076 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.6028/jres.087.010 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|