Split graphs

European Journal of Combinatorics

Volumn 24, Issue 4, 2003, Pages 413-430

  Merris, Russell ^a  

^a CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

Clique; Graph Realization; Graphic Partition; Hasse diagram; Independent set; Majorization; Muirhead's lemma; Partition lattice; Ruch Gutman criterion; Ryser switch; Shifted shape; Strict partition; Threshold graph; Threshold partition

Indexed keywords

EID: 0038333547     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0195-6698(03)00030-1     Document Type: Article

References (34)

1. Arikati S.R. Peled U.N. Degree sequences and majorization Linear Algebra Appl. 199 1994 179-211
2. Arikati S.R. Peled U.N. The realization graph of a degree sequence with majorization gap 1 is Hamiltonian Linear Algebra Appl. 290 1999 213-235
3. Beard J.T.B. Jr., Dorris, A.D. On uniquely realizable degree sequences (manuscript)
4. Chvátal V. Hammer P.L. Aggregation of inequalities in integer programming Annals Disc. Math. 1 1977 145-162
5. n Math. Z. 215 1994 347-365
6. Foldes S. Hammer P.L. Split graphs Proceedings of the 8th South-Eastern Conference on Combinatorics, Graph Theory and Computing 1977 311-315
7. Gasharov V. The Erdös-Gallai criterion and symmetric functions European J. Combin. 18 1997 287-294
8. Grund R. Konstruktion schlichter Graphen mit gegebener Gradpartition (Construction of univalent graphs with given partition by degree) Bayreuth. Math. Schr. 44 1993 73-104
9. Hammer P.L. Ibaraki T. Simeone B. Threshold sequences SIAM J. Alg. Disc. Meth. 2 1981 39-49
10. Hammer P.L. Simeone B. The splittance of a graph Combinatorica 1 1981 275-284
11. Harary F. Peled U. Hamiltonian threshold graphs Disc. Appl. Math. 16 1987 11-15
12. Hässelbarth W. Die Verzweigtheit von Graphen (MATCH) Comm. Math. & Computer Chem. 16 1984 3-17
13. chunk class of synchronizing primitives SIAM. J. Comput. 6 1977 88-108
14. Ibaraki T. Peled U.N. Sufficient conditions for graphs to have threshold number 2 Hansen P. Studies on Graphs and Discrete Programming 1981 241-268 North-Holland Amsterdam
15. Kelmans A. On homotopy of connected graphs having the same degree function Discrete Math. 230 2001 167-187
16. Kleitman D.J. Li S.-Y. A note on unigraphic sequences Stud. Appl. Math. 54 1975 283-287
17. Koren M. Extreme degree sequences of simple graphs J. Combin. Theory Ser. B 15 1973 213-224
18. Li S.-Y.R. Graphic sequences with unique realization J. Combin. Theory Ser. B 19 1975 42-68
19. Mahadev N.V.R. Peled U.N. Strict 2-threshold graphs Discrete Appl. Math. 21 1988 113-131
20. Mahadev N.V.R. Peled U.N. Threshold Graphs and Related Topics 1995 Elsevier Amsterdam
21. Marshall A.W. Olkin I. Inequalities: Theory of Majorization and Its Applications 1979 Academic Press New York
22. Merris R. Degree maximal graphs are Laplacian integral Linear Algebra Appl. 199 1994 381-389
23. Merris R. Threshold graphs Proc. Prague Math. Conf. 1996 205-210 ICARIS Ltd. Prague
24. Merris R. Graph Theory 2001 Wiley Interscience New York
25. Merris, R. Roby, T. The lattice of threshold graphs (manuscript)
26. Orlin J. The minimal integral separator of a threshold graph Annals Disc. Math. 1 1977 415-419
27. Parthasarathy K.R. Enumeration of graphs with given partition Canad. J. Math. 20 1968 40-47
28. Peled U.N. Threshold graph enumeration and series-product identities Congr. Numer. 291 1980 735-738
29. Peled U.N. Srinivasan M.K. The polytope of degree sequences Linear Algebra Appl. 114-115 1989 349-377
30. Ruch E. Gutman I. The branching extent of graphs J. Combin. Inform. System Sci. 4 1979 285-295
31. Ryser H.J. Combinatorial Mathematics Carus Monographs vol. 14 1963 Math. Assoc. America Washington D.C.
32. Sierksma G. Hoogeveen H. Seven criteria for sequences being graphic J. Graph Theory 15 1991 223-231
33. Tyshkevich R. Decompostion of graphical sequences and unigraphs Discrete Math. 220 2000 201-238
34. T.G. Will, Switching distances between graphs with the same degree, SIAM J. Discrete Math. 12 (1999) 298-306.