Open Access(H,k) stable graphs with minimum size
Author(s) -
Aneta Dudek,
Artur Szymański,
Małgorzata Zwonek
Publication year - 2008
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1397
Subject(s) - mathematics , combinatorics , discrete mathematics
Let us call a G (H, k) graph vertex stable if it contains a subgraph H ever after removing any of its k vertices. By Q(H, k) we will denote the minimum size of an (H, k) vertex stable graph. In this paper, we are interested in finding Q(C3, k), Q(C4, k), Q(K1,p, k) and Q(Ks, k).
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom