Let G(V,E) be a simple graph, the edge-binding number b1 (G) of G is defined as where N(S) denotes the adjacent edges set of S. In this paper, we obtained the edge-binding number of outer plane graphs, Halin graph and...Let G(V,E) be a simple graph, the edge-binding number b1 (G) of G is defined as where N(S) denotes the adjacent edges set of S. In this paper, we obtained the edge-binding number of outer plane graphs, Halin graph and tree.展开更多
基金the National Natural Science Foundation of China (No.19871036).
文摘Let G(V,E) be a simple graph, the edge-binding number b1 (G) of G is defined as where N(S) denotes the adjacent edges set of S. In this paper, we obtained the edge-binding number of outer plane graphs, Halin graph and tree.
