Download PDF - (H,k) stable bipartite graphs with minimum sizeAll rights reserved. Copyright exceptions and limitations apply

ArticleOriginal scientific text

Title

(H,k) stable bipartite graphs with minimum size

Authors 1, 1

Affiliations

  1. Faculty of Applied Mathematics, AGH University of Science and Technology, Kraków, Poland

Abstract

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.

Keywords

ENG
graph, vertex stable graph

Bibliography

  1. A. Dudek, A. Szymański and M. Zwonek, (H,k) stable graphs with minimum size, Discuss. Math. Graph Theory 28 (2008) 137-149, doi: 10.7151/dmgt.1397.
  2. P. Frankl and G.Y. Katona, Extremal k-edge-hamiltonian hypergraphs, Discrete Math. 308 (2008) 1415-1424, doi: 10.1016/j.disc.2007.07.074.
  3. I. Horváth and G.Y. Katona, Extremal stable graphs, submitted.
Discussiones Mathematicae Graph Theory
2009/29/3
Export to PBN, Opens in new tab
Pages:
573-581
Main language of publication
English
Received
2008-05-23
Accepted
2008-09-26
Published
2009

DOI: 10.7151/dmgt.1465

Exact and natural sciences