Opening book details…
Can I read On the Least Size of a Graph with a Given Degree Set on EtoBox?
On the Least Size of a Graph with a Given Degree Set by Amitabha Tripathi; Sujith Vijay is a Computer Science article available to read on EtoBox.
What is On the Least Size of a Graph with a Given Degree Set about?
The degree set of a finite simple graph G is the set of distinct degrees of vertices of G. A theorem of Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] asserts that the least order of a graph with a given degree set D is 1 + max(D). We look at the analogous problem concerning the least size of a graph with a given degree set D. We determine the least size for the sets D when (i) |D| 3; (ii) D = {1, 2, . . . , n}; and (iii) every element in D is at least |D|. In addition, we give sharp upper and lower bounds in all cases.
Who reads On the Least Size of a Graph with a Given Degree Set?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Amitabha Tripathi; Sujith Vijay
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0166-218X)
- Published
- 2006
- Language
- EN
- Field
- Computer Science (Physical Sciences)