In this paper we prove that the generalized permutation graph G（n, k） is upper embeddable if it has at most two odd subcycles, and that the maximum genus of G（n, k） is more than 「β（G（n,k））/3」 in most cases.
Let G be a 3 edge connected graph (possibly with multiple edges or loops), and let γ M(G) and β(G) be the maximum genus and the Betti number of G, respectively. Then γ M(G)≥β(G)/3 can be proved and this...Let G be a 3 edge connected graph (possibly with multiple edges or loops), and let γ M(G) and β(G) be the maximum genus and the Betti number of G, respectively. Then γ M(G)≥β(G)/3 can be proved and this answers a question posed by Chen, et al. in 1996.F FIRST OR展开更多
The strong embeddability is a notion of metric geometry, which is an intermediate property lying between coarse embeddability and property A. In this paper, we study the permanence properties of strong embeddability f...The strong embeddability is a notion of metric geometry, which is an intermediate property lying between coarse embeddability and property A. In this paper, we study the permanence properties of strong embeddability for metric spaces. We show that strong embeddability is coarsely invariant and it is closed under taking subspaces, direct products, direct limits and finite unions. Furthermore, we show that a metric space is strongly embeddable if and only if it has weak finite decomposition complexity with respect to strong embeddability.展开更多
The strong embeddability is a notion of metric geometry, which is an intermediate property lying between coarse embeddability and property A. In this paper, the permanence properties of strong embeddability for groups...The strong embeddability is a notion of metric geometry, which is an intermediate property lying between coarse embeddability and property A. In this paper, the permanence properties of strong embeddability for groups acting on metric spaces are studied. The authors show that a finitely generated group acting on a finitely asymptotic dimension metric space by isometries whose K-stabilizers are strongly embeddable is strongly embeddable. Moreover, they prove that the fundamental group of a graph of groups with strongly embeddable vertex groups is also strongly embeddable.展开更多
Combined with the edge-connectivity, this paper investigates the relationship between the edge independence number and upper embeddability. And we obtain the following result: Let G be a k-edge-connected graph with gi...Combined with the edge-connectivity, this paper investigates the relationship between the edge independence number and upper embeddability. And we obtain the following result: Let G be a k-edge-connected graph with girth g. If α '(G)≤((k-1)2+2) [g/2]+(1-(-1)n)/2((k-1)(k-2)+1)-1,where k =1, 2, 3, and α (G) denotes the edge independence number of G, then G is upper embeddable and the upper bound is best possible. And it has generalized the relative results.展开更多
In this paper we mainly prove that let G be a(k+1)-edge-connected simple graph of order n with girth g.Then G is upper embeddable if for any independent set I(G) = {vi | 1 i k2 + 2},k = 0,1,2 and the lower bound is ti...In this paper we mainly prove that let G be a(k+1)-edge-connected simple graph of order n with girth g.Then G is upper embeddable if for any independent set I(G) = {vi | 1 i k2 + 2},k = 0,1,2 and the lower bound is tight.展开更多
A connected loopless graph that can be embedded on some (orientable or nonorientable) surface such that the size of each face does not exceed 5 is upper embeddable.
This paper discusses the development of Boolean methods in some topics on graph em-beddings which are related to VLSI. They are mainly the general theory of graph embeddability, the orientabilities of a graph and the ...This paper discusses the development of Boolean methods in some topics on graph em-beddings which are related to VLSI. They are mainly the general theory of graph embeddability, the orientabilities of a graph and the rectilinear layout of an electronic circuit.展开更多
1. Introduction Let κ be a non-negative integer. A κ-bend graph is a plane graph in which every edgeis a broken line consisting of at most κ+ 1 horizontal or vertical segments. A bend is any point which is the inte...1. Introduction Let κ be a non-negative integer. A κ-bend graph is a plane graph in which every edgeis a broken line consisting of at most κ+ 1 horizontal or vertical segments. A bend is any point which is the intersection of a horizontal segment and a verticalsegment of an edge. A planar graph G is κ-rectilinear if it admits a plane embedding Gwhich is a κ-bend graph. In this case G is said to be a κ-embedding of G.展开更多
基金The NSF (10671073) of Chinathe Scientific Fund (03080045) of the Gathered Talents by Nantong UniversityNSF (07KJB110090) of Jiangsu University.
文摘In this paper we prove that the generalized permutation graph G（n, k） is upper embeddable if it has at most two odd subcycles, and that the maximum genus of G（n, k） is more than 「β（G（n,k））/3」 in most cases.
文摘Let G be a 3 edge connected graph (possibly with multiple edges or loops), and let γ M(G) and β(G) be the maximum genus and the Betti number of G, respectively. Then γ M(G)≥β(G)/3 can be proved and this answers a question posed by Chen, et al. in 1996.F FIRST OR
基金Supported by National Natural Science Foundation of China(Grant No.11231002)
文摘The strong embeddability is a notion of metric geometry, which is an intermediate property lying between coarse embeddability and property A. In this paper, we study the permanence properties of strong embeddability for metric spaces. We show that strong embeddability is coarsely invariant and it is closed under taking subspaces, direct products, direct limits and finite unions. Furthermore, we show that a metric space is strongly embeddable if and only if it has weak finite decomposition complexity with respect to strong embeddability.
基金supported by the National Natural Science Foundation of China(Nos.11231002,11771061)
文摘The strong embeddability is a notion of metric geometry, which is an intermediate property lying between coarse embeddability and property A. In this paper, the permanence properties of strong embeddability for groups acting on metric spaces are studied. The authors show that a finitely generated group acting on a finitely asymptotic dimension metric space by isometries whose K-stabilizers are strongly embeddable is strongly embeddable. Moreover, they prove that the fundamental group of a graph of groups with strongly embeddable vertex groups is also strongly embeddable.
基金supported by National Natural Science Foundation of China (Grant No.10771062) New Century Excellent Talents in University (Grant No.NCET-07-0276)
文摘Combined with the edge-connectivity, this paper investigates the relationship between the edge independence number and upper embeddability. And we obtain the following result: Let G be a k-edge-connected graph with girth g. If α '(G)≤((k-1)2+2) [g/2]+(1-(-1)n)/2((k-1)(k-2)+1)-1,where k =1, 2, 3, and α (G) denotes the edge independence number of G, then G is upper embeddable and the upper bound is best possible. And it has generalized the relative results.
文摘In this paper we mainly prove that let G be a(k+1)-edge-connected simple graph of order n with girth g.Then G is upper embeddable if for any independent set I(G) = {vi | 1 i k2 + 2},k = 0,1,2 and the lower bound is tight.
文摘A connected loopless graph that can be embedded on some (orientable or nonorientable) surface such that the size of each face does not exceed 5 is upper embeddable.
基金the National Natural Science Foundation of China (Grant No. 69973001) .
文摘This paper discusses the development of Boolean methods in some topics on graph em-beddings which are related to VLSI. They are mainly the general theory of graph embeddability, the orientabilities of a graph and the rectilinear layout of an electronic circuit.
文摘1. Introduction Let κ be a non-negative integer. A κ-bend graph is a plane graph in which every edgeis a broken line consisting of at most κ+ 1 horizontal or vertical segments. A bend is any point which is the intersection of a horizontal segment and a verticalsegment of an edge. A planar graph G is κ-rectilinear if it admits a plane embedding Gwhich is a κ-bend graph. In this case G is said to be a κ-embedding of G.
