The classical hypercube structure is a popular topological architecture in parallel computing environments and a large number of variations based on the hypercube were posed in the past three decades. Reliability eval...The classical hypercube structure is a popular topological architecture in parallel computing environments and a large number of variations based on the hypercube were posed in the past three decades. Reliability evaluation of systems is important to the design and maintenance of multiprocessor systems. The h-extra edge-connectivity of graph G（V, E） is a kind of measure for the reliability of interconnection systems, which is defined as the minimum cardinality of a subset of edge set, if any, whose deletion disconnects G and such that every re- maining component has at least h vertices. This paper shows that the h-extra edge-connectivity 2n-1 2n-1 of the hypercube Qn is a constant 2n-1 for 2n-1/3≤ h2n-1, and n ≥ 4, which extends the result of [Bounding the size of the subgraph induced by m vertices and extra edge-connectivity of hypercubes, Discrete Applied Mathematics, 2013, 161（16）： 2753-2757].展开更多
With positive integers r,t and n,where n≥rt and t≥2,the maximum number of edges of a simple graph of order n is estimated,which does not contain r disjoint copies of K_r for r=2 and 3.
The edge-face chromatic number Xef （G） of a plane graph G is the least number of colors assigned to the edges and faces such that every adjacent or incident pair of them receives different colors. In this article, t...The edge-face chromatic number Xef （G） of a plane graph G is the least number of colors assigned to the edges and faces such that every adjacent or incident pair of them receives different colors. In this article, the authors prove that every 2-connected plane graph G with △（G）≥｜G｜ - 2≥9 has Xef（G） = △（G）.展开更多
The edge-domsaturation number ds'(G) of a graph G = (V, E) is the least positive integer k such that every edge of G lies in an edge dominating set of cardinality k. In this paper, we characterize unicyclic graphs...The edge-domsaturation number ds'(G) of a graph G = (V, E) is the least positive integer k such that every edge of G lies in an edge dominating set of cardinality k. In this paper, we characterize unicyclic graphs G with ds'(G) = q – Δ'(G) + 1 and investigate well-edge dominated graphs. We further define γ'–-critical, γ'+-critical, ds'–-critical, ds'+-critical edges and study some of their properties.展开更多
The effective theory for the hierarchical fractional quantum Hall (FQH) effect is proposed. We also derive the topological numbers K matrix and t vector and the general edge excitation from the effective theory. One c...The effective theory for the hierarchical fractional quantum Hall (FQH) effect is proposed. We also derive the topological numbers K matrix and t vector and the general edge excitation from the effective theory. One can End that the two issues in rapidly rotating ultracold atoms are similar to those in electron FQH liquid.展开更多
To achieve high-performance compressor cascades at low Reynolds number(Re),it is important to organize the boundary layer transition and separation processes efficiently and reasonably.In this study,the airfoil is foc...To achieve high-performance compressor cascades at low Reynolds number(Re),it is important to organize the boundary layer transition and separation processes efficiently and reasonably.In this study,the airfoil is focused on at a 5%blade height at the root of the orthogonal blade in the downflow passage of the high-load booster stage.The bionics modeling design is carried out for the leading edge of the original blade cascade;the response characteristics of laminar transition and separation to blades with different leading edge shapes at low Reynolds numbers are studied by using large eddy simulations combined with Omega vortex identification.The findings of this study demonstrate that bionic leading edge modeling can significantly improve the aerodynamic performance of blades at low Reynolds numbers.The blades effectively suppress the formation of separation bubbles at low Reynolds numbers and weaken or even eliminate large-scale flow separation at the trailing edge.In addition,the blades can weaken the vortex intensity on the blade surface,reduce the areas of high-velocity fluctuations,and minimize aerodynamic losses caused by turbulence dissipation.These results should serve as a valuable reference for the aerodynamic design and flow control of the high-load booster stage blade at low Re.展开更多
It is known in the computational electromagnetics （CEM） that the node element has a relative wellconditioned matrix, but suffers from the spurious solution problem; whereas the edge element has no spurious solutions...It is known in the computational electromagnetics （CEM） that the node element has a relative wellconditioned matrix, but suffers from the spurious solution problem; whereas the edge element has no spurious solutions, but usually produces an ill-conditioned matrix. Particularly, when the mesh is over dense, the iterative solution of the matrix equation from edge element converges very slowly. Based on the node element and edge element, a node-edge element is presented, which has no spurious solutions and better-conditioned matrix. Numerical experiments demonstrate that the proposed node-edge element is more efficient than now-widely used edge element.展开更多
Let f be a proper edge coloring of G using k colors. For each x ∈ V（G）, the set of the colors appearing on the edges incident with x is denoted by Sf（x） or simply S（x） if no confusion arise. If S（u） = S（v） ...Let f be a proper edge coloring of G using k colors. For each x ∈ V（G）, the set of the colors appearing on the edges incident with x is denoted by Sf（x） or simply S（x） if no confusion arise. If S（u） = S（v） and S（v） S（u） for any two adjacent vertices u and v, then f is called a Smarandachely adjacent vertex distinguishing proper edge col- oring using k colors, or k-SA-edge coloring. The minimum number k for which G has a Smarandachely adjacent-vertex-distinguishing proper edge coloring using k colors is called the Smarandachely adjacent-vertex-distinguishing proper edge chromatic number, or SA- edge chromatic number for short, and denoted by Xsa（G）. In this paper, we have discussed the SA-edge chromatic number of K4 V Kn.展开更多
Let be a simple graph with vertex set and edge set . Let have at least vertices of degree at least , where and are positive integers. A function is said to be a signed -edge cover of if for at least vertices of , wher...Let be a simple graph with vertex set and edge set . Let have at least vertices of degree at least , where and are positive integers. A function is said to be a signed -edge cover of if for at least vertices of , where . The value , taking over all signed -edge covers of is called the signed -edge cover number of and denoted by . In this paper we give some bounds on the signed -edge cover number of graphs.展开更多
ErdOs,Gimbel and Straight （1990） conjectured that if ω（G）〈5 and z（G）〉3,then z（G）≥Z（G）-2. But by using the concept of edge cochromatic number it is proved that if G is the line graph of a connected triang...ErdOs,Gimbel and Straight （1990） conjectured that if ω（G）〈5 and z（G）〉3,then z（G）≥Z（G）-2. But by using the concept of edge cochromatic number it is proved that if G is the line graph of a connected triangle-free graph with ω（G）〈5 and G≠K4, then z（G）≥X（G）-2.展开更多
Topological phases and their associated multiple edge states are studied by constructing a one-dimensional non-unitary multi-period quantum walk with parity-time symmetry.It is shown that large topological numbers can...Topological phases and their associated multiple edge states are studied by constructing a one-dimensional non-unitary multi-period quantum walk with parity-time symmetry.It is shown that large topological numbers can be obtained when choosing an appropriate time frame.The maximum value of the winding number can reach the number of periods in the one-step evolution operator.The validity of the bulk-edge correspondence is confirmed,while for an odd-period quantum walk and an even-period quantum walk,they have different configurations of the 0-energy edge state andπ-energy edge state.On the boundary,two kinds of edge states always coexist in equal amount for the odd-period quantum walk,however three cases including equal amount,unequal amount or even only one type may occur for the even-period quantum walk.展开更多
It is hard to compute the competition number for a graph in general and characterizing a graph by its competition number has been one of important research problems in the study of competition graphs. Sano pointed out...It is hard to compute the competition number for a graph in general and characterizing a graph by its competition number has been one of important research problems in the study of competition graphs. Sano pointed out that it would be interesting to compute the competition numbers of some triangulations of a sphere as he got the exact value of the competition numbers of regular polyhedra. In this paper, we study the competition numbers of several kinds of triangulations of a sphere, and get the exact values of the competition numbers of a 24-hedron obtained from a hexahedron by adding a vertex in each face of the hexahedron and joining the vertex added in a face with the four vertices of the face, a class of dodecahedra constructed from a hexahedron by adding a diagonal in each face of the hexahedron, and a triangulation of a sphere with 3n (n≥2) vertices.展开更多
The decay number of a connected graph is defined to be the minimum number of the components of the cotree of the graph. Upper bounds of the decay numbers of graphs are obtained according to their edge connectivities. ...The decay number of a connected graph is defined to be the minimum number of the components of the cotree of the graph. Upper bounds of the decay numbers of graphs are obtained according to their edge connectivities. All the bounds in this paper are tight.Moreover, for each integer k between one and the upper bound, there are infinitely many graphs with the decay number k.展开更多
Pascal Triangle is more of a number construction （body） then an array of the binomial coefficients. It is a mathematical body, like the digital code feeds for computer but with 2 dimensions. And there should be bodi...Pascal Triangle is more of a number construction （body） then an array of the binomial coefficients. It is a mathematical body, like the digital code feeds for computer but with 2 dimensions. And there should be bodies with x-dimensions and even abnormal or irregular appearances.展开更多
In this paper, we will study the adjacent strong edge coloring of series-parallel graphs, and prove that series-parallel graphs of △(G) = 3 and 4 satisfy the conjecture of adjacent strong edge coloring using the doub...In this paper, we will study the adjacent strong edge coloring of series-parallel graphs, and prove that series-parallel graphs of △(G) = 3 and 4 satisfy the conjecture of adjacent strong edge coloring using the double inductions and the method of exchanging colors from the aspect of configuration property. For series-parallel graphs of △(G) ≥ 5, △(G) ≤ x'as(G) ≤ △(G) + 1. Moreover, x'as(G) = △(G) + 1 if and only if it has two adjacent vertices of maximum degree, where △(G) and X'as(G) denote the maximum degree and the adjacent strong edge chromatic number of graph G respectively.展开更多
基金Supported by the National Natural Science Foundation of China(11171283,11471273,11461038,11301440)Natural Sciences Foundation of Shanxi Province(2014021010-2)
文摘The classical hypercube structure is a popular topological architecture in parallel computing environments and a large number of variations based on the hypercube were posed in the past three decades. Reliability evaluation of systems is important to the design and maintenance of multiprocessor systems. The h-extra edge-connectivity of graph G（V, E） is a kind of measure for the reliability of interconnection systems, which is defined as the minimum cardinality of a subset of edge set, if any, whose deletion disconnects G and such that every re- maining component has at least h vertices. This paper shows that the h-extra edge-connectivity 2n-1 2n-1 of the hypercube Qn is a constant 2n-1 for 2n-1/3≤ h2n-1, and n ≥ 4, which extends the result of [Bounding the size of the subgraph induced by m vertices and extra edge-connectivity of hypercubes, Discrete Applied Mathematics, 2013, 161（16）： 2753-2757].
文摘With positive integers r,t and n,where n≥rt and t≥2,the maximum number of edges of a simple graph of order n is estimated,which does not contain r disjoint copies of K_r for r=2 and 3.
基金This research is supported by NNSF of China(40301037, 10471131)
文摘The edge-face chromatic number Xef （G） of a plane graph G is the least number of colors assigned to the edges and faces such that every adjacent or incident pair of them receives different colors. In this article, the authors prove that every 2-connected plane graph G with △（G）≥｜G｜ - 2≥9 has Xef（G） = △（G）.
文摘The edge-domsaturation number ds'(G) of a graph G = (V, E) is the least positive integer k such that every edge of G lies in an edge dominating set of cardinality k. In this paper, we characterize unicyclic graphs G with ds'(G) = q – Δ'(G) + 1 and investigate well-edge dominated graphs. We further define γ'–-critical, γ'+-critical, ds'–-critical, ds'+-critical edges and study some of their properties.
文摘The effective theory for the hierarchical fractional quantum Hall (FQH) effect is proposed. We also derive the topological numbers K matrix and t vector and the general edge excitation from the effective theory. One can End that the two issues in rapidly rotating ultracold atoms are similar to those in electron FQH liquid.
基金financially supported by the National Science and Technology Major Project(2019-Ⅱ-0004-0024)Youth Innovation Promotion Association CAS(No.2020148)。
文摘To achieve high-performance compressor cascades at low Reynolds number(Re),it is important to organize the boundary layer transition and separation processes efficiently and reasonably.In this study,the airfoil is focused on at a 5%blade height at the root of the orthogonal blade in the downflow passage of the high-load booster stage.The bionics modeling design is carried out for the leading edge of the original blade cascade;the response characteristics of laminar transition and separation to blades with different leading edge shapes at low Reynolds numbers are studied by using large eddy simulations combined with Omega vortex identification.The findings of this study demonstrate that bionic leading edge modeling can significantly improve the aerodynamic performance of blades at low Reynolds numbers.The blades effectively suppress the formation of separation bubbles at low Reynolds numbers and weaken or even eliminate large-scale flow separation at the trailing edge.In addition,the blades can weaken the vortex intensity on the blade surface,reduce the areas of high-velocity fluctuations,and minimize aerodynamic losses caused by turbulence dissipation.These results should serve as a valuable reference for the aerodynamic design and flow control of the high-load booster stage blade at low Re.
文摘It is known in the computational electromagnetics （CEM） that the node element has a relative wellconditioned matrix, but suffers from the spurious solution problem; whereas the edge element has no spurious solutions, but usually produces an ill-conditioned matrix. Particularly, when the mesh is over dense, the iterative solution of the matrix equation from edge element converges very slowly. Based on the node element and edge element, a node-edge element is presented, which has no spurious solutions and better-conditioned matrix. Numerical experiments demonstrate that the proposed node-edge element is more efficient than now-widely used edge element.
基金Supported by NNSF of China(61163037,61163054,61363060)
文摘Let f be a proper edge coloring of G using k colors. For each x ∈ V（G）, the set of the colors appearing on the edges incident with x is denoted by Sf（x） or simply S（x） if no confusion arise. If S（u） = S（v） and S（v） S（u） for any two adjacent vertices u and v, then f is called a Smarandachely adjacent vertex distinguishing proper edge col- oring using k colors, or k-SA-edge coloring. The minimum number k for which G has a Smarandachely adjacent-vertex-distinguishing proper edge coloring using k colors is called the Smarandachely adjacent-vertex-distinguishing proper edge chromatic number, or SA- edge chromatic number for short, and denoted by Xsa（G）. In this paper, we have discussed the SA-edge chromatic number of K4 V Kn.
文摘Let be a simple graph with vertex set and edge set . Let have at least vertices of degree at least , where and are positive integers. A function is said to be a signed -edge cover of if for at least vertices of , where . The value , taking over all signed -edge covers of is called the signed -edge cover number of and denoted by . In this paper we give some bounds on the signed -edge cover number of graphs.
基金Supported by the Natural Science Foundation of Gansu Province (3ZS051-A25-025).
文摘ErdOs,Gimbel and Straight （1990） conjectured that if ω（G）〈5 and z（G）〉3,then z（G）≥Z（G）-2. But by using the concept of edge cochromatic number it is proved that if G is the line graph of a connected triangle-free graph with ω（G）〈5 and G≠K4, then z（G）≥X（G）-2.
基金supported by the National Natural Science Foundation of China(Grant No.12004231).
文摘Topological phases and their associated multiple edge states are studied by constructing a one-dimensional non-unitary multi-period quantum walk with parity-time symmetry.It is shown that large topological numbers can be obtained when choosing an appropriate time frame.The maximum value of the winding number can reach the number of periods in the one-step evolution operator.The validity of the bulk-edge correspondence is confirmed,while for an odd-period quantum walk and an even-period quantum walk,they have different configurations of the 0-energy edge state andπ-energy edge state.On the boundary,two kinds of edge states always coexist in equal amount for the odd-period quantum walk,however three cases including equal amount,unequal amount or even only one type may occur for the even-period quantum walk.
文摘It is hard to compute the competition number for a graph in general and characterizing a graph by its competition number has been one of important research problems in the study of competition graphs. Sano pointed out that it would be interesting to compute the competition numbers of some triangulations of a sphere as he got the exact value of the competition numbers of regular polyhedra. In this paper, we study the competition numbers of several kinds of triangulations of a sphere, and get the exact values of the competition numbers of a 24-hedron obtained from a hexahedron by adding a vertex in each face of the hexahedron and joining the vertex added in a face with the four vertices of the face, a class of dodecahedra constructed from a hexahedron by adding a diagonal in each face of the hexahedron, and a triangulation of a sphere with 3n (n≥2) vertices.
基金Supported by the NSFC(10201022)Supported by the NSFCBJ(1012003)
文摘The decay number of a connected graph is defined to be the minimum number of the components of the cotree of the graph. Upper bounds of the decay numbers of graphs are obtained according to their edge connectivities. All the bounds in this paper are tight.Moreover, for each integer k between one and the upper bound, there are infinitely many graphs with the decay number k.
文摘Pascal Triangle is more of a number construction （body） then an array of the binomial coefficients. It is a mathematical body, like the digital code feeds for computer but with 2 dimensions. And there should be bodies with x-dimensions and even abnormal or irregular appearances.
基金National Natural Science Foundation of China (60103021, 60274026)
文摘In this paper, we will study the adjacent strong edge coloring of series-parallel graphs, and prove that series-parallel graphs of △(G) = 3 and 4 satisfy the conjecture of adjacent strong edge coloring using the double inductions and the method of exchanging colors from the aspect of configuration property. For series-parallel graphs of △(G) ≥ 5, △(G) ≤ x'as(G) ≤ △(G) + 1. Moreover, x'as(G) = △(G) + 1 if and only if it has two adjacent vertices of maximum degree, where △(G) and X'as(G) denote the maximum degree and the adjacent strong edge chromatic number of graph G respectively.
