A note on the strong edge-coloring of outerplanar graphs with maximum degree 3Acta Mathematicae Applicatae Sinica, English Series - Tập 32 - Trang 883-890 - 2016
Shun-yi Liu, He-ping Zhang, Hong-liang Lu, Yu-qing Lin
A strong k-edge-coloring of a graph G is an assignment of k colors to the edges of G in such a way that any two edges meeting at a common vertex, or being adjacent to the same edge of G, are assigned different colors. The strong chromatic index of G is the smallest integer k for which G has a strong k-edge-coloring. In this paper, we have shown that the strong chromatic index is no larger than 6 f...... hiện toàn bộ
Two limit theorems on ARIMA modelsActa Mathematicae Applicatae Sinica, English Series - Tập 4 - Trang 154-164 - 1988
Hongzhi An, Hongye Gao
Let the time series {X(t), t=1, 2, ...} satisfy φ(B)(1−B)
d
X(t)=ϑ(B)e(t), whereB is a backward shift operator, defined byBX(t)=X(t−1), and φ(z)=1+φ1
z+...+φ
p
z
p
, ϑ(z)=1+ϑ1
z+...+я
q
z
q
, and all the roots of φ(z) lie out...... hiện toàn bộ
On detection of change points using mean vectorsActa Mathematicae Applicatae Sinica, English Series - Tập 9 - Trang 193-203 - 1993
Baiqi Miao, Lincheng Zhao, P. R. Krishnaiah
In this paper, the authors consider the problem of change points within the framework of model selection and propose a procedure for estimating the locations of change points when the number of change points is known. The strong consistency of this procedure is also established. The problem of detecting change points is discussed within the framework of the simultaneous test procedure. The case wh...... hiện toàn bộ
Case-cohort analysis with general additive-multiplicative hazard modelsActa Mathematicae Applicatae Sinica, English Series - Tập 32 - Trang 851-866 - 2016
Yi Sun, Wen Yu, Ming Zheng
The case-cohort design is widely used in large epidemiological studies and prevention trials for cost reduction. In such a design, covariates are assembled only for a subcohort which is a random subset of the entire cohort and any additional cases outside the subcohort. In this paper, we discuss the case-cohort analysis with a class of general additive-multiplicative hazard models which includes t...... hiện toàn bộ
The Number of Circles of a Maximum State of a Plane Graph with ApplicationsActa Mathematicae Applicatae Sinica, English Series - - 2021
Xian-an Jin, Jun Ge, Xiao-Sheng Cheng, Yu-qing Lin
Motivated by the connection with the genus of the corresponding link and its application on DNA polyhedral links, in this paper, we introduce a parameter smax(G), which is the maximum number of circles of states of the link diagram D(G) corresponding to a plane (positive) graph G. We show that smax(G) does not depend on the embedding of G and if G is a 4-edge-connected plane graph then smax(G) is ...... hiện toàn bộ
An Inverse Design Method for Non-uniform Flow Inlet with a Given Shock WaveActa Mathematicae Applicatae Sinica, English Series - Tập 35 - Trang 287-304 - 2019
Wen-you Qiao, An-yuan Yu, Yu-hui Wang
For the hypersonic inlet and fore-body integrated design, the non-uniform incoming flow generated by the fore-body will bring a relatively big challenge to the inward-turning inlet design. To make the inlet match the non-uniform incoming flow, this paper, based on previous studies, develops a cross-stream marching plus (CSMP) method, by which an aerodynamic surface used to generate a given shock s...... hiện toàn bộ
On connected factors inK 1,3-free graphsActa Mathematicae Applicatae Sinica, English Series - Tập 14 - Trang 43-47 - 1998
Li Guojun, Giu Zhenhong
A graph is said to beK
1,3-free if it contains noK
1,3 as an induced subgraph. It is shown in this paper that every 2-connectedK
1,3-free graph contains a connected [2,3]-factor. We also obtain that every connectedK
1,3-free graph has a spanning tree with maximum degree at most 3.