Number Of Plane Graphs Research Articles

On the edge-binding number of some plane graphs

LetG(V,E) be a simple graph, the edge-binding number b1 (G) ofG is defined as $$b_1 (G) = \min \left\{ {\left. {\frac{{|N(S)|}}{{|S|}}} \right|\emptyset \ne S \subset E,N(S) \ne E} \right\},$$ whereN(S) denotes the adjacent edges set ofS. In this paper, we obtained the edge-binding number of outer plane graphs, Halin graph and tree.