A Vulnerability Parameter of Networks
-
Published:2021-03
Issue:3-4
Volume:109
Page:517-526
-
ISSN:0001-4346
-
Container-title:Mathematical Notes
-
language:en
-
Short-container-title:Math Notes
Author:
Çiftçi C.,Aytaç A.
Publisher
Pleiades Publishing Ltd
Subject
General Mathematics
Reference21 articles.
1. H. Frank and I. T. Frisch, “Analysis and design of survivable networks,” IEEE Trans. Comm. Tech. COM-1, 501–519 (1970).
2. S. Lawrencenko and Q. Luo, “Graphs with given connectivity properties,” Networks 30 (4), 255–261 (1997).
3. V. Chvátal, “Tough graphs and Hamiltonian circuits,” Discrete Math. 5, 215–228 (1973).
4. K. S. Bagga, L. W. Beineke, W. D. Goddard, M. J. Lipman, and R. E. Pippert, “A survey of integrity,” Discrete Appl. Math. 37/38, 13–28 (1992).
5. H. A. Jung, “On maximal circuits in finite graphs,” Ann. Discrete Math. 3, 129–144 (1978).