The realization graph of a degree sequence with majorization gap 1 is Hamiltonian

Linear Algebra and Its Applications

Volumn 290, Issue 1-3, 1999, Pages 213-235

  Arikati, Srinivasa R ^a   Peled, Uri N ^b  

^a CADENCE DESIGN SYSTEMS   (United States)

^b University of Illinois   (United States)

Author keywords

Degree sequence; Hamiltonian graph; Majorization; Realization

Indexed keywords

EID: 0039698684     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(98)10229-X     Document Type: Article

References (20)

1. S.R. Arikati, U.N. Peled, Degree sequences and majorization, Linear Algebra Appl. 199 (1994) 179-211.
2. C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.
3. R.A. Brualdi, Matrices of zeros and ones with fixed row and column sum vectors. Linear Algebra Appl. 33 (1980) 159-231.
4. V. Chvátal, P.L. Hammer, Aggregation of inequalities in integer programming, Annals of Discrete Mathematics, vol. 1, North-Holland, Amsterdam, 1997, pp. 145-162.
5. D.R. Fulkerson, A.J. Hoffman, M.H. McAndrew, Some properties of graphs with multiple edges, Can. J. Math. 17 (1965) 166-177.
6. P.L. Hammer, T. Ibaraki, B. Simeone, Threshold sequences, SIAM J. Algebraic Discrete Methods 2 (1981) 39-49.
7. F. Harary, Graph Theory, Addison-Wesley, New York, 1969.
8. G.H. Hardy, J.E. Littlewood, G. Pólya, Inequalities, Second ed., Cambridge Univ. Press, London, 1952.
9. P.L. Hammer, B. Simeone, The splittance of a graph, Combinatorica 1 (1981) 275-284.
10. M. Koren, Extreme degree sequences of simple graphs, J. Combin. Theory B 15 (1973) 213-224.
11. X. Li, F. Zhang, Hamiltonicity of a type of interchange graphs, Discrete Appl. Math. 51 (1994) 107-111.
12. N.V.R. Mahadev, U.N. Peled, On a conjecture of Wang and Williams, J. Graph Theory 15 (1991) 115-120.
13. N.V.R. Mahadev, U.N. Peled, Threshold Graphs and Related Topics, Annals of Discrete Mathematics, vol. 56, North-Holland, Amsterdam, 1995.
14. A.W. Marshall, I. Olkin, Inequalities: Theory of Majorization and Its Applications, Academic Press, New York, 1979.
15. S.B. Maurer, Matroid basis graphs I, J. Combin. Theory B 14 (1973) 216-240.
16. S.B. Maurer, Matroid basis graphs II, J. Combin. Theory B 15 (1973) 121-145.
17. U.N. Peled, B. Simeone, The threshold measure of a graph, in: M. Guan et al. (Eds.), Graph Theory and Its Applications: East and West, Annals of the New York Academy of Sciences, vol. 567, 1989, pp. 441-457.
18. U.N. Peled, M.K. Srinivasan, The polytope of degree sequences, Linear Algebra Appl. 114/115 (1989) 349-377.
19. E. Ruch, I. Gutman, The branching extent of graphs, J. Combinatorics, Information & System Sciences 4 (1979) 285-295.
20. C. Wang, A.C. Williams, The threshold weight of a graph, J. Graph Theory 15 (1991) 235-249.