On the Vulnerability of Permutation Graphs of Complete and Complete Bipartite Graphs

Authors

D. Guichard
Barry L. Piazza, University of Southern Mississippi
Sam K. Stueckle, Northeastern UniversityFollow

Document Type

Article

Publication Date

6-1-1991

Department

Mathematics

School

Mathematics and Natural Sciences

Abstract

In this paper the authors study the vulnerability parameters of integrity, toughness, and binding number for two classes of graphs. These two classes of graphs are permutation graphs of complete graphs and permutation graphs of complete bipartite graphs.

Publication Title

Ars Combinatoria

Volume

31

First Page

149

Last Page

157

Recommended Citation

Guichard, D., Piazza, B. L., Stueckle, S. K. (1991). On the Vulnerability of Permutation Graphs of Complete and Complete Bipartite Graphs. Ars Combinatoria, 31, 149-157.
Available at: https://aquila.usm.edu/fac_pubs/7037