Distance and connectivity measures in permutation graphs

Discrete Mathematics

Volumn 271, Issue 1-3, 2003, Pages 61-70

  Goddard, Wayne ^a,d   Raines, Michael E ^b   Slater, Peter J ^c  

^a UNIVERSITY OF KWAZULU NATAL   (South Africa)

^b WESTERN MICHIGAN UNIVERSITY   (United States)

^c University of Alabama in Huntsville ^*  (United States)

^d Clemson University   (United States)

Author keywords

Augmenting; Connectivity; Generalized prism; Permutation graph

Indexed keywords

PARAMETER ESTIMATION; SET THEORY; THEOREM PROVING;

PERMUTATION GRAPHS;

GRAPH THEORY;

EID: 0042389569     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00870-1     Document Type: Article

References (12)

1. Bang-Jensen J., Gabow H.N., Jordán T., Szigeti Z. Edge-connectivity augmentation with partition constraints. SIAM J. Discrete Math. 12:1999;160-207.
2. Chartrand G., Harary F. Planar permutation graphs. Ann. Inst. H. Poincaré Sec. B. 3:1967;433-438.
3. Chartrand G., Lesniak L. Graphs and Digraphs. 3rd Edition:1996;Chapman & Hall, London.
4. Gu W. On upper bound of diameters of permutation graphs. Congr. Numer. 121:1996;223-230.
5. Gu W. On diameter of permutation graphs. Networks. 33:1999;161-166.
6. Jia X. On diameter of permutation graphs. Congr. Numer. 121:1996;138-146.
7. Lai H.-J. Large survivable nets and the generalized prisms. Discrete Appl. Math. 61:1995;181-185.
8. B. Piazza, Connectivity and Hamiltonian properties of permutation graphs, Ph.D. Dissertation, Clemson University, 1985.
9. Piazza B. Edge-connectivity of permutation graphs. Congr. Numer. 65:1988;7-16.
10. Piazza B.L., Ringeisen R.D. Connectivity of generalized prisms over. G Discrete Appl. Math. 30:1991;229-233.
11. Piazza B., Stueckle S. On the cut frequency vector of permutation graphs. Congr. Numer. 49:1985;143-145.
12. West D. Introduction to Graph Theory. 1996;Prentice-Hall, Upper Saddle River.