For a graph G and two positive integers j and k, an m-L（j, k）-edge-labeling of G is an assignment on the edges to the set {0,..., m}, such that adjacent edges receive labels differing by at least j, and edges which ...For a graph G and two positive integers j and k, an m-L（j, k）-edge-labeling of G is an assignment on the edges to the set {0,..., m}, such that adjacent edges receive labels differing by at least j, and edges which are distance two apart receive labels differing by at least k. The λ′j,k-number of G is the minimum m of an m-L（j, k）-edge-labeling admitted by G.In this article, we study the L（1, 2）-edge-labeling for paths, cycles, complete graphs, complete multipartite graphs, infinite ？-regular trees and wheels.展开更多
A dominating set of a graph G is a set of vertices that contains at least one endpoint of every edge on the graph. The domination number of G is the order of a minimum dominating set of G. The (t, r) broadcast dominat...A dominating set of a graph G is a set of vertices that contains at least one endpoint of every edge on the graph. The domination number of G is the order of a minimum dominating set of G. The (t, r) broadcast domination is a generalization of domination in which a set of broadcasting vertices emits signals of strength t that decrease by 1 as they traverse each edge, and we require that every vertex in the graph receives a cumulative signal of at least r from its set of broadcasting neighbors. In this paper, we extend the study of (t, r) broadcast domination to directed graphs. Our main result explores the interval of values obtained by considering the directed (t, r) broadcast domination numbers of all orientations of a graph G. In particular, we prove that in the cases r = 1 and (t, r) = (2, 2), for every integer value in this interval, there exists an orientation of G which has directed (t, r) broadcast domination number equal to that value. We also investigate directed (t, r) broadcast domination on the finite grid graph, the star graph, the infinite grid graph, and the infinite triangular lattice graph. We conclude with some directions for future study.展开更多
In this paper,a new type of entropy,directional preimage entropy including topological and measure theoretic versions for■-actions,is introduced.Some of their properties including relationships and the invariance are...In this paper,a new type of entropy,directional preimage entropy including topological and measure theoretic versions for■-actions,is introduced.Some of their properties including relationships and the invariance are obtained.Moreover,several systems including■-actions generated by the expanding maps,■-actions defined on finite graphs and some infinite graphs with zero directional preimage branch entropy are studied.展开更多
To decide when a graph is Gromov hyperbolic is,in general,a very hard problem.In this paper,we solve this problem for the set of short graphs（in an informal way,a graph G is r-short if the shortcuts in the cycles of ...To decide when a graph is Gromov hyperbolic is,in general,a very hard problem.In this paper,we solve this problem for the set of short graphs（in an informal way,a graph G is r-short if the shortcuts in the cycles of G have length less than r）：an r-short graph G is hyperbolic if and only if S9r（G）is finite,where SR（G）：=sup{L（C）：C is an R-isometric cycle in G}and we say that a cycle C is R-isometric if dC（x,y）≤dG（x,y）＋R for every x,y∈C.展开更多
The study of hyperbolic graphs is an interesting topic since the hyperbolicity of a geodesic metric space is equivalent to the hyperbolicity of a graph related to it.The main result in this paper is a very simple char...The study of hyperbolic graphs is an interesting topic since the hyperbolicity of a geodesic metric space is equivalent to the hyperbolicity of a graph related to it.The main result in this paper is a very simple characterization of the hyperbolicity of a large class of periodic planar graphs.展开更多
In recent years diverse literatures have been published on circulants (cf. [2] and the references cited therein). In this paper we consider the infinite analogues of circulant and random infinite circulant, and their ...In recent years diverse literatures have been published on circulants (cf. [2] and the references cited therein). In this paper we consider the infinite analogues of circulant and random infinite circulant, and their connectivities and hamiltonian properties are discussed. Especially we answer a question of [4] in the case of infinite (undirected) circulants, and some results on random infinite circulants are also obtained.展开更多
基金Supported by the National Natural Science Foundation of China(Grant Nos.1097102510901035)
文摘For a graph G and two positive integers j and k, an m-L（j, k）-edge-labeling of G is an assignment on the edges to the set {0,..., m}, such that adjacent edges receive labels differing by at least j, and edges which are distance two apart receive labels differing by at least k. The λ′j,k-number of G is the minimum m of an m-L（j, k）-edge-labeling admitted by G.In this article, we study the L（1, 2）-edge-labeling for paths, cycles, complete graphs, complete multipartite graphs, infinite ？-regular trees and wheels.
文摘A dominating set of a graph G is a set of vertices that contains at least one endpoint of every edge on the graph. The domination number of G is the order of a minimum dominating set of G. The (t, r) broadcast domination is a generalization of domination in which a set of broadcasting vertices emits signals of strength t that decrease by 1 as they traverse each edge, and we require that every vertex in the graph receives a cumulative signal of at least r from its set of broadcasting neighbors. In this paper, we extend the study of (t, r) broadcast domination to directed graphs. Our main result explores the interval of values obtained by considering the directed (t, r) broadcast domination numbers of all orientations of a graph G. In particular, we prove that in the cases r = 1 and (t, r) = (2, 2), for every integer value in this interval, there exists an orientation of G which has directed (t, r) broadcast domination number equal to that value. We also investigate directed (t, r) broadcast domination on the finite grid graph, the star graph, the infinite grid graph, and the infinite triangular lattice graph. We conclude with some directions for future study.
文摘In this paper,a new type of entropy,directional preimage entropy including topological and measure theoretic versions for■-actions,is introduced.Some of their properties including relationships and the invariance are obtained.Moreover,several systems including■-actions generated by the expanding maps,■-actions defined on finite graphs and some infinite graphs with zero directional preimage branch entropy are studied.
基金Supported by Ministerio de Ciencia e Innovación of Spain(Grant No.MTM 2009-07800)a grant from Consejo Nacional De Ciencia Y Tecnologia of México(Grant No.CONACYT-UAG I0110/62/10)
文摘To decide when a graph is Gromov hyperbolic is,in general,a very hard problem.In this paper,we solve this problem for the set of short graphs（in an informal way,a graph G is r-short if the shortcuts in the cycles of G have length less than r）：an r-short graph G is hyperbolic if and only if S9r（G）is finite,where SR（G）：=sup{L（C）：C is an R-isometric cycle in G}and we say that a cycle C is R-isometric if dC（x,y）≤dG（x,y）＋R for every x,y∈C.
基金Supported by Ministerio de Ciencia e Innovaci'on of Spain(Grant No.MTM 2009-07800)the last author also by a grant from CONACY of TM'exico(Grant No.CONACYT-UAG I0110/62/10)
文摘The study of hyperbolic graphs is an interesting topic since the hyperbolicity of a geodesic metric space is equivalent to the hyperbolicity of a graph related to it.The main result in this paper is a very simple characterization of the hyperbolicity of a large class of periodic planar graphs.
文摘In recent years diverse literatures have been published on circulants (cf. [2] and the references cited therein). In this paper we consider the infinite analogues of circulant and random infinite circulant, and their connectivities and hamiltonian properties are discussed. Especially we answer a question of [4] in the case of infinite (undirected) circulants, and some results on random infinite circulants are also obtained.
