A short proof of a theorem on degree sets of graphs |
| |
| Authors: | Amitabha Tripathi |
| |
| Affiliation: | a Department of Mathematics, Indian Institute of Technology, Hauz Khas, New Delhi-110016, India
b Department of Mathematics, Rutgers University-New Brunswick, Piscataway, NJ 08854, USA |
| |
| Abstract: | For a finite simple graph G, we denote the set of degrees of its vertices, known as its degree set, by D(G). Kapoor, Polimeni and Wall [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] have determined the least number of vertices among graphs with a given degree set. We give a very short proof of this result. |
| |
| Keywords: | Degree sequences Degree sets |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
