摘要：AbstractLetG=(V,E)be a simple, finite and undirected(p,q)-graph withpvertices andqedges. A graphGis Skolem odd difference mean if there exists an injectionf:V(G)→{0,1,2,…,p+3q-3}and an induced bijectionf∗:E(G)→{1,3,5,…,2q-1}such that each edgeuv(withf(u)>f(v)) is labeled withf∗(uv)=f(u)-f(v)2. We sayGis Skolem even difference mean if there exists an injectionf:V(G)→{0,1,2,…,p+3q-1}and an induced bijectionf∗:E(G)→{2,4,6,…,2q}such that each edgeuv(withf(u)>f(v)) is labeled withf∗(uv)=f(u)-f(v)2. A graph that admits a Skolem odd (or even) difference mean labeling is called a Skolem odd (or even) difference mean graph. In this paper, first, we construct some new Skolem odd difference mean graphs and then investigate the Skolem even difference meanness of some standard graphs.
关键词：Mean labeling;Odd mean labeling;Skolem difference mean labeling;Skolem odd difference mean labeling;Skolem even difference mean labeling
