Binding numbers of fractional k-deleted graphs
Kotani, Keiko
Proc. Japan Acad. Ser. A Math. Sci., Tome 86 (2010) no. 1, p. 85-88 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Let k be an integer with $k \ge 2$. We show that if G be a graph such that $|G| > 4k+1 -4\sqrt {k-1}$ and $bind(G)> {(2k-1)(n-1) \over k(n-2)},$ then G is a fractional k-deleted graph. We also show that in the case where k is even, if G be a graph such that $|G| > 4k+1 -4\sqrt {k}$ and $bind(G)> {(2k-1)(n-1) \over k(n-2)+1},$ then G is a fractional k-deleted graph.
Publié le : 2010-04-15
Classification:  Binding number,  fractional factor,  05C70 
@article{1270127452,
     author = {Kotani, Keiko},
     title = {Binding numbers of fractional k-deleted graphs},
     journal = {Proc. Japan Acad. Ser. A Math. Sci.},
     volume = {86},
     number = {1},
     year = {2010},
     pages = { 85-88},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1270127452}
}

Kotani, Keiko. Binding numbers of fractional k-deleted graphs. Proc. Japan Acad. Ser. A Math. Sci., Tome 86 (2010) no. 1, pp.  85-88. http://gdmltest.u-ga.fr/item/1270127452/