共查询到20条相似文献,搜索用时 15 毫秒
1.
Let G =(V, E) be a connected simple graph. A labeling f : V → Z2 induces an edge labeling f* : E → Z2 defined by f*(xy) = f(x) +f(y) for each xy ∈ E. For i ∈ Z2, let vf(i) = |f^-1(i)| and ef(i) = |f*^-1(i)|. A labeling f is called friendly if |vf(1) - vf(0)| ≤ 1. For a friendly labeling f of a graph G, we define the friendly index of G under f by if(G) = e(1) - el(0). The set [if(G) | f is a friendly labeling of G} is called the full friendly index set of G, denoted by FFI(G). In this paper, we will determine the full friendly index set of every Cartesian product of two cycles. 相似文献
2.
Harris Kwong 《Discrete Mathematics》2008,308(23):5522-5532
Let G be a graph with vertex set V and edge set E, and let A be an abelian group. A labeling f:V→A induces an edge labeling f∗:E→A defined by f∗(xy)=f(x)+f(y). For i∈A, let vf(i)=card{v∈V:f(v)=i} and ef(i)=card{e∈E:f∗(e)=i}. A labeling f is said to be A-friendly if |vf(i)−vf(j)|≤1 for all (i,j)∈A×A, and A-cordial if we also have |ef(i)−ef(j)|≤1 for all (i,j)∈A×A. When A=Z2, the friendly index set of the graph G is defined as {|ef(1)−ef(0)|:the vertex labelingf is Z2-friendly}. In this paper we completely determine the friendly index sets of 2-regular graphs. In particular, we show that a 2-regular graph of order n is cordial if and only if n?2 (mod 4). 相似文献
3.
We study some properties of sets of differences of dense sets in ℤ2 and ℤ3 and their interplay with Bohr neighbourhoods in ℤ. We obtain, inter alia, the following results.
(i) | If E ⊂ ℤ2, $
\bar d
$
\bar d
(E) > 0 and p
i
, q
i
∈ ℤ[x], i = 1, ..., m satisfy p
i
(0) = q
i
(0) = 0, then there exists B ⊂ ℤ such that $
\bar d
$
\bar d
(B) > 0 and
|
设为首页 | 免责声明 | 关于勤云 | 加入收藏 |
Copyright©北京勤云科技发展有限公司 京ICP备09084417号 |