The edge binding number of some graphs

Lin Liu · 1999

Let G(V,E) be a simple graph, the edge binding number b 1(G) of G is defined asb 1(G)= min {|N(S)||S||≠SE,N(S)≠E}Where N(S)={e|e∈E and e adjacent with at least one edge in S }.In this paper, We obtained the edge binding number of Halin graph and θ graph.

Read the paper · More papers on PaperTik