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）.展开更多
We study a new family of random variables that each arise as the distribution of the maximum or minimum of a random number N of i.i.d. random variables X<sub>1</sub>, X<sub>2</sub>,…, X<sub...We study a new family of random variables that each arise as the distribution of the maximum or minimum of a random number N of i.i.d. random variables X<sub>1</sub>, X<sub>2</sub>,…, X<sub>N</sub>, each distributed as a variable X with support on [0, 1]. The general scheme is first outlined, and several special cases are studied in detail. Wherever appropriate, we find estimates of the parameter θ in the one-parameter family in question.展开更多
In the multilevel thresholding segmentation of the image, the classification number is always given by the supervisor. To solve this problem, a fast multilevel thresholding algorithm considering both the threshold val...In the multilevel thresholding segmentation of the image, the classification number is always given by the supervisor. To solve this problem, a fast multilevel thresholding algorithm considering both the threshold value and the classification number is proposed based on the maximum entropy, and the self-adaptive criterion of the classification number is given. The algorithm can obtain thresholds and automatically decide the classification number. Experimental results show that the algorithm is effective.展开更多
Let x（G^2） denote the chromatic number of the square of a maximal outerplanar graph G and Q denote a maximal outerplanar graph obtained by adding three chords y1 y3, y3y5, y5y1 to a 6-cycle y1y2…y6y1. In this paper...Let x（G^2） denote the chromatic number of the square of a maximal outerplanar graph G and Q denote a maximal outerplanar graph obtained by adding three chords y1 y3, y3y5, y5y1 to a 6-cycle y1y2…y6y1. In this paper, it is proved that △ ＋ 1 ≤ x（G^2） ≤△ ＋ 2, and x（G^2） = A ＋ 2 if and only if G is Q, where A represents the maximum degree of G.展开更多
Let G be a maximal outerplane graph and X0(G) the complete chromatic number of G. This paper determines exactly X0(G) for △(G)≠5 and proves 6≤X0.(G)≤7 for △(G) = 5, where △(G) is the maximum degree of vertices o...Let G be a maximal outerplane graph and X0(G) the complete chromatic number of G. This paper determines exactly X0(G) for △(G)≠5 and proves 6≤X0.(G)≤7 for △(G) = 5, where △(G) is the maximum degree of vertices of G.展开更多
基金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）.
文摘We study a new family of random variables that each arise as the distribution of the maximum or minimum of a random number N of i.i.d. random variables X<sub>1</sub>, X<sub>2</sub>,…, X<sub>N</sub>, each distributed as a variable X with support on [0, 1]. The general scheme is first outlined, and several special cases are studied in detail. Wherever appropriate, we find estimates of the parameter θ in the one-parameter family in question.
文摘In the multilevel thresholding segmentation of the image, the classification number is always given by the supervisor. To solve this problem, a fast multilevel thresholding algorithm considering both the threshold value and the classification number is proposed based on the maximum entropy, and the self-adaptive criterion of the classification number is given. The algorithm can obtain thresholds and automatically decide the classification number. Experimental results show that the algorithm is effective.
文摘Let x（G^2） denote the chromatic number of the square of a maximal outerplanar graph G and Q denote a maximal outerplanar graph obtained by adding three chords y1 y3, y3y5, y5y1 to a 6-cycle y1y2…y6y1. In this paper, it is proved that △ ＋ 1 ≤ x（G^2） ≤△ ＋ 2, and x（G^2） = A ＋ 2 if and only if G is Q, where A represents the maximum degree of G.
基金Project supported by the Vatural SCience Foundation of LNEC.
文摘Let G be a maximal outerplane graph and X0(G) the complete chromatic number of G. This paper determines exactly X0(G) for △(G)≠5 and proves 6≤X0.(G)≤7 for △(G) = 5, where △(G) is the maximum degree of vertices of G.
