Let j, k and m be three positive integers, a circular m-L（j, k）-labeling of a graph G is a mapping f： V（G）→{0, 1, …, m-1}such that f（u）-f（v）m≥j if u and v are adjacent, and f（u）-f（v）m≥k if u and v are...Let j, k and m be three positive integers, a circular m-L（j, k）-labeling of a graph G is a mapping f： V（G）→{0, 1, …, m-1}such that f（u）-f（v）m≥j if u and v are adjacent, and f（u）-f（v）m≥k if u and v are at distance two,where a-bm=min{a-b,m-a-b}. The minimum m such that there exists a circular m-L（j, k）-labeling of G is called the circular L（j, k）-labeling number of G and is denoted by σj, k（G）. For any two positive integers j and k with j≤k,the circular L（j, k）-labeling numbers of trees, the Cartesian product and the direct product of two complete graphs are determined.展开更多
For a graph G and two positive integers j and k an m-L j k -edge-labeling of G is an assignment from the set 0 1 … m-to the edges such that adjacent edges receive labels that differ by at least j and edges at distanc...For a graph G and two positive integers j and k an m-L j k -edge-labeling of G is an assignment from the set 0 1 … m-to the edges such that adjacent edges receive labels that differ by at least j and edges at distance two receive labels that differ by at least k.Theλ′j k-number of G denoted byλ′j k G is the minimum integer m overall m-L j k -edge-labeling of G.The necklace is a specific type of Halin graph.The L 1 2 -edge-labeling of necklaces is studied and the lower and upper bounds on λ′1 2-number for necklaces are given.Also both the lower and upper bounds are attainable.展开更多
For a positive integer k,the total{k}-dominating function(T{k}DF)of a graph G without isolated vertices is a function f from the vertex set V(G)to the set{0,1,2,…,k}such that for each vertex v∈V(G),the sum of the va...For a positive integer k,the total{k}-dominating function(T{k}DF)of a graph G without isolated vertices is a function f from the vertex set V(G)to the set{0,1,2,…,k}such that for each vertex v∈V(G),the sum of the values of all its neighbors assigned by f is at least k.A set{f_(1),f_(2),…,f_(d)}of pairwise different T{k}DF s of G with the property that∑d i=1 f_(i)(v)≤k for each v∈V(G),is called a total{k}-dominating family(T{k}D family)of G.The total{k}-domatic number of a graph G,denoted by d^({k})_(t)(G),is the maximum number of functions in T{k}D family.In 2013,Aram et al.proposed a problem that whether or not d^({k})_(t)(C_(m)□C_(n))=3 when 4 nmk,and d^({k})_(t)(C m□C n)=4 when 4|nmk.It was shown that d^({k})_(t)(C_(m)□C_(n))=3 if 4 nmk and k≥2 or 4|nmk and 2 nk,which partially answered the above problem.In addition,the total{k}-domatic number of the direct product of a cycle and a path,two paths,and two cycles was studied,respectively.展开更多
Let k be a commutative ring, C a projective k-coalgebra. The smash productsof entwining structure (A, C)_ψ are discussed. When the map ψ is a bijective, and C is a finitelygenerated k-module, a version of the Ulbric...Let k be a commutative ring, C a projective k-coalgebra. The smash productsof entwining structure (A, C)_ψ are discussed. When the map ψ is a bijective, and C is a finitelygenerated k-module, a version of the Ulbrich theorem for coalgebras C is given.展开更多
In this paper, the integral-type Stancu operators on a simplex is considered and its inverse theorem of approximation in Lp（1≤ p 〈＋∞）has been obtained.
基金The National Natural Science Foundation of China(No.10971025)
文摘Let j, k and m be three positive integers, a circular m-L（j, k）-labeling of a graph G is a mapping f： V（G）→{0, 1, …, m-1}such that f（u）-f（v）m≥j if u and v are adjacent, and f（u）-f（v）m≥k if u and v are at distance two,where a-bm=min{a-b,m-a-b}. The minimum m such that there exists a circular m-L（j, k）-labeling of G is called the circular L（j, k）-labeling number of G and is denoted by σj, k（G）. For any two positive integers j and k with j≤k,the circular L（j, k）-labeling numbers of trees, the Cartesian product and the direct product of two complete graphs are determined.
基金The National Natural Science Foundation of China(No.10971025,10901035)
文摘For a graph G and two positive integers j and k an m-L j k -edge-labeling of G is an assignment from the set 0 1 … m-to the edges such that adjacent edges receive labels that differ by at least j and edges at distance two receive labels that differ by at least k.Theλ′j k-number of G denoted byλ′j k G is the minimum integer m overall m-L j k -edge-labeling of G.The necklace is a specific type of Halin graph.The L 1 2 -edge-labeling of necklaces is studied and the lower and upper bounds on λ′1 2-number for necklaces are given.Also both the lower and upper bounds are attainable.
基金Supported by NNSF of China(11671376,11401004)Anhui Provincial Natural Science Foundation(1708085MA18)
文摘For a positive integer k,the total{k}-dominating function(T{k}DF)of a graph G without isolated vertices is a function f from the vertex set V(G)to the set{0,1,2,…,k}such that for each vertex v∈V(G),the sum of the values of all its neighbors assigned by f is at least k.A set{f_(1),f_(2),…,f_(d)}of pairwise different T{k}DF s of G with the property that∑d i=1 f_(i)(v)≤k for each v∈V(G),is called a total{k}-dominating family(T{k}D family)of G.The total{k}-domatic number of a graph G,denoted by d^({k})_(t)(G),is the maximum number of functions in T{k}D family.In 2013,Aram et al.proposed a problem that whether or not d^({k})_(t)(C_(m)□C_(n))=3 when 4 nmk,and d^({k})_(t)(C m□C n)=4 when 4|nmk.It was shown that d^({k})_(t)(C_(m)□C_(n))=3 if 4 nmk and k≥2 or 4|nmk and 2 nk,which partially answered the above problem.In addition,the total{k}-domatic number of the direct product of a cycle and a path,two paths,and two cycles was studied,respectively.
文摘Let k be a commutative ring, C a projective k-coalgebra. The smash productsof entwining structure (A, C)_ψ are discussed. When the map ψ is a bijective, and C is a finitelygenerated k-module, a version of the Ulbrich theorem for coalgebras C is given.
基金Supported by the NNSF of China(10371080)Supported by the Educational Committee Foundation of Beijing(01KJ-101)
文摘In this paper, the integral-type Stancu operators on a simplex is considered and its inverse theorem of approximation in Lp（1≤ p 〈＋∞）has been obtained.
