Contents

Ars Combinatoria

  • Research article

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

D. Guichard1, B. Piazza2, S. Stueckle3
1 Whitman College
2University of Southern Mississippi
3Clemson University
  • Published: 30/06/1991

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

Citation
D. Guichard, B. Piazza, S. Stueckle. On the Vulnerability of Permutation Graphs of Complete and Complete Bipartite Graphs[J], Ars Combinatoria, Volume 031. 149-157. .