Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Sahdev, Aditya"'
Publikováno v:
Discrete Applied Mathematics 333 (2023), 32-42
The degree set of a finite simple graph $G$ is the set of distinct degrees of vertices of $G$. A theorem of Kapoor, Polimeni & Wall asserts that the least order of a graph with a given degree set $\mathscr D$ is $1+\max \mathscr D$. Tripathi & Vijay
Externí odkaz:
http://arxiv.org/abs/2009.10294
Publikováno v:
In Discrete Applied Mathematics 15 July 2023 333:32-42
