This paper presents the number of combinatorially distinct rooted Eulerian planar maps with the number of non-root-vertices and the number of non-root-faces as two parameters. The parametric expressions for determinin...This paper presents the number of combinatorially distinct rooted Eulerian planar maps with the number of non-root-vertices and the number of non-root-faces as two parameters. The parametric expressions for determining the number in tha loopless Eulerian case are also obtained.展开更多
The bondage number of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph a domination number greater than the domination number of G. In this paper, we prove that ...The bondage number of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph a domination number greater than the domination number of G. In this paper, we prove that for a 1-planar graph G.展开更多
In ref I, under the condition that the components of velocity are only the functions of time and polar angle θ , Drornikov solved eqss. (1.1) (1.3) of the ideal gas unsteady planar parallel potential flow. It was poi...In ref I, under the condition that the components of velocity are only the functions of time and polar angle θ , Drornikov solved eqss. (1.1) (1.3) of the ideal gas unsteady planar parallel potential flow. It was pointed out in ref. [1] that in general cases, the evident solutions could not he obtained. Only for two especial cases, the evident solutions were obtained.In this paper, the author studies the same prohlein as that in ref. [1]. In the first section we obtain the evident solution of equations (1.1)-(1.3) under the condition that the sonic velocity is restricted by some complemental conditions. In the second section, we obtain the first-order approximate solutions of the fundamental equation for the case that γ>>1展开更多
The planar Ramsey number PR (H1, H2) is the smallest integer n such that any planar graph on n vertices contains a copy of H1 or its complement contains a copy of H2. It is known that the Ramsey number R(K4 -e, K6) = ...The planar Ramsey number PR (H1, H2) is the smallest integer n such that any planar graph on n vertices contains a copy of H1 or its complement contains a copy of H2. It is known that the Ramsey number R(K4 -e, K6) = 21, and the planar Ramsey numbers PR(K4 - e, Kl) for l ≤ 5 are known. In this paper, we give the lower bounds on PR (K4 ? e, Kl) and determine the exact value of PR (K4 - e, K6).展开更多
基金Supported by the Italian National Research Councilthe National Natural Science Foundation of China.
文摘This paper presents the number of combinatorially distinct rooted Eulerian planar maps with the number of non-root-vertices and the number of non-root-faces as two parameters. The parametric expressions for determining the number in tha loopless Eulerian case are also obtained.
文摘The bondage number of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph a domination number greater than the domination number of G. In this paper, we prove that for a 1-planar graph G.
文摘In ref I, under the condition that the components of velocity are only the functions of time and polar angle θ , Drornikov solved eqss. (1.1) (1.3) of the ideal gas unsteady planar parallel potential flow. It was pointed out in ref. [1] that in general cases, the evident solutions could not he obtained. Only for two especial cases, the evident solutions were obtained.In this paper, the author studies the same prohlein as that in ref. [1]. In the first section we obtain the evident solution of equations (1.1)-(1.3) under the condition that the sonic velocity is restricted by some complemental conditions. In the second section, we obtain the first-order approximate solutions of the fundamental equation for the case that γ>>1
文摘The planar Ramsey number PR (H1, H2) is the smallest integer n such that any planar graph on n vertices contains a copy of H1 or its complement contains a copy of H2. It is known that the Ramsey number R(K4 -e, K6) = 21, and the planar Ramsey numbers PR(K4 - e, Kl) for l ≤ 5 are known. In this paper, we give the lower bounds on PR (K4 ? e, Kl) and determine the exact value of PR (K4 - e, K6).
