Open Access(H,k) stable bipartite graphs with the minimum size
Author(s) -
Aneta Dudek,
Małgorzata Zwonek
Publication year - 2009
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.1465
Subject(s) - combinatorics , mathematics , bipartite graph , vertex (graph theory) , graph , induced subgraph , pancyclic graph , discrete mathematics , chordal graph , 1 planar graph
Let us call a graph G (H ; k) vertex stable if it contains a subgraph H after removing any of its k vertices. In this paper we are interested in finding the (Kn,n+1; 1) (respectively (Kn,n; 1)) vertex stable graphs with minimum size.
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