Weakly threshold graphs
We define a weakly threshold sequence to be a degree sequence $d=(d_1,\dots,d_n)$ of a graph having the property that $\sum_{i \leq k} d_i \geq k(k-1)+\sum_{i > k} \min\{k,d_i\} - 1$ for all positive $k \leq \max\{i:d_i \geq i-1\}$. The weakly threshold graphs are the realizations of the weakly t...
| 出版年: | Discrete Mathematics & Theoretical Computer Science |
|---|---|
| 第一著者: | |
| フォーマット: | 論文 |
| 言語: | 英語 |
| 出版事項: |
Discrete Mathematics & Theoretical Computer Science
2018-06-01
|
| 主題: | |
| オンライン･アクセス: | https://dmtcs.episciences.org/3968/pdf |