A connected graph is highly irregular if each of its vertices is adjacent only to vertices with distinct degrees. In this paper w e investigate several problems concerning the existence and enumeration of highly irregular graphs as well as their independence numbers, with particular focus on the cor
β¦ LIBER β¦
Degree sequences of highly irregular graphs
β Scribed by Zofia Majcher; Jerzy Michael
- Book ID
- 108316230
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 496 KB
- Volume
- 164
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Highly irregular graphs
β
Yousef Alavi; Gary Chartrand; F. R. K. Chung; Paul ErdΓΆs; R. L. Graham; Ortrud R
π
Article
π
1987
π
John Wiley and Sons
π
English
β 531 KB
Degree Sequences of Infinite Graphs
β
Blass, A.; Harary, F.
π
Article
π
1981
π
Oxford University Press
π
English
β 161 KB
Highly irregular m-chromatic graphs
β
Yousef Alavi; Fred Buckley; Marc Shamula; Sergio Ruiz
π
Article
π
1988
π
Elsevier Science
π
English
β 620 KB
A graph is highly irregular if it is connected and the neighbors of each vertex have distinct degrees. In this paper, we study existence and extremal problems for highly irregular graphs with a given maximum degree and focus our attention on highly irregular graphs that are m-chromatic for m 3 2.
Graphs and degree sequences. I
β
R. I. Tyshkevich; A. A. Chernyak; Zh. A. Chernyak
π
Article
π
1988
π
Springer US
π
English
β 984 KB
Extreme degree sequences of simple graph
β
Michael Koren
π
Article
π
1973
π
Elsevier Science
π
English
β 501 KB
Signed degree sequences of signed graphs
β
Yan, Jing-Ho; Lih, Ko-Wei; Kuo, David; Chang, Gerard J.
π
Article
π
1997
π
John Wiley and Sons
π
English
β 105 KB
π 2 views
sequence to be the signed degree sequence of a signed graph or a signed tree, answering a question raised by