环状硅酸盐图的友好指数集

Let G be a graph with vertex set V(G) and edge set E(G). A labeling f : V(G) →Z2 induces an edge labeling f*: E(G) → Z2 defined by f*(xy) = f(x) + f(y), for each edge xy ∈ E(G). For i ∈ Z2, let vf(i) = |{v ∈ V(G) : f(v) = i}| and ef(i) = |{e ∈ E(G) : f*(e) =i}|. A labeling f of a graph G is said to be friendly if |vf(0)- vf(1)| ≤ 1. The friendly index set of the graph G, denoted FI(G), is defined as {|ef(0)- ef(1)|: the vertex labeling f is friendly}. This is a generalization of graph cordiality. We investigate the friendly index sets of cyclic silicates CS(n, m).     

圈的$L(d_1,d_2,\ldots,d_t)$-数$\lambda(C_n;d_1,d_2,\ldots,d_t)$

An L（d0,d2,...,dt）-labeling of a graph G is a function f from its vertex set V（G） to the set {0,1,..., k} for some positive integer k such that If（x） - f（y）l ≥di, if the distance between vertices x and y in G is equal to i for i = 1,2,...,t. The L（d1,d2,...,dt）-number λ（G;d1,d2,... ,dt） of G is the smallest integer number k such that G has an L（d1,d2,...,dr）- labeling with max{f （x）｜x ∈ V（G）} = k. In this paper, we obtain the exact values for λ（Cn; 2, 2, 1） and λ（Cn; 3, 2, 1）, and present lower and upper bounds for λ（Cn; 2,..., 2, 1,..., 1）     

路的积图的边平衡性质

2009年, Kwong和Lee考虑了一个图论中新的标号问题—图的边平衡指标集.在本文中,通过利用嵌入标号图的方法,考察了路的积图的边平衡性质.