Let G be a graph with vertex set V(G) and edge set E(G), and let A ={0,1}. A labeling f: V(G) → A induces an edge partial labeling f~* : E(G) → A defined by Οf~*(xy) = f(x), if and only if f(x)=f(y) for each edge xy ∈ E(G). For i ∈ A, let v_f(i) = card {v ∈ V(G) : f(v) = i} and e_(f*)(i) = card{e ∈ E(G) : f~*(e) = i). A labeling f of a graph G is said to be friendly if | v_f(0)- v_f(l) | ≤ 1. If, | _f(0) -e_f(l) I < 1 then G is said to be balanced. In this paper we prove several families of regular windmill and general windmill graphs are balanced.
展开▼
