1.
An Equivalent Condition of Bn Convex, Jn Convex and Pn convex;
B_n凸,J_n凸与P_n凸的一种等价条件
2.
On the total coloring number of C_mP_na nd GP_n
C_mP_n和GP_n的全色数
3.
On the Edge Chromatic Number of Join-graph of Mycielski Graph of Join-Graph of P_n∨P_n S_n∨S_n
关于P_n∨P_n和S_n∨S_n的Mycielski图的边染色
4.
The Crossing Number of Flower Snark and K_m-e□P_n;
Flower Snark和K_m-e□P_n的交叉数
5.
ON EQUITABLE TOTAL-COLORING OF K_(1,m)∨P_n;
K_(1,m)∨P_n的均匀全染色
6.
Smarandachely Adjacent Vertex Totol of Graph P_m+P_n
图P_m+P_n的Smarandachely邻点全色数
7.
On Adjacent Vertex Distinguishing Total Coloring of the Joint Graph Wm∨Pn;
联图W_m∨P_n的邻点可区别全染色
8.
On adjacent vertex-distinguishing total colorings of graphs P_m*P_n;
关于图P_m*P_n的邻点可区别全染色
9.
ADJACENT VERTEX-DISTINGUISHING EDGES COLORING OF(P_n∨P_m);
P_n∨P_m的邻点可区别边染色
10.
ADJACENT STRONG VERTEX-DISTINGUISHING TOTAL COLORING OF P_n~k(k≡2(mod 3));
P_n~k(k≡2(mod3))的邻点可区别的强全染色
11.
Adjacent Strong Verte-Distinuishing Total Coloring of D(p_n)
D(p_n)图的邻点强可区别全染色
12.
The Minimum Fill-in of the Grid Graph on Plane
平面格子图P_m×P_n的最小填充
13.
The Total Labelling of the Unite of Path and Path Graphs
路与路的联图P_m∨P_n的(2,1)-全标号
14.
The Identities of Adjoint Polynomials of Graphs of Shape and Factorization;
图簇G_r~(P_n)的伴随多项式的恒等式及其因式分解
15.
On the Adjacent Vertex Distinguishing Equitable Total Coloring of P_n V C_n;
关于联图P_n∨C_n的邻点可区别的均匀全染色
16.
Strengthening the Process Management\= in Cotton Textile Enterprises with X\|R and Pn Control\|chart;
用-R与P_n控制图强化棉纺织企业的过程控制
17.
On (a, d)-Antimagic Labelings of Generalized Petersen Grapgs and Radio Number of P_2□P_n
广义Petersen图的（a，d）-反边幻标号和图P_2□P_n的广播标号
18.
The Crossing Number of Cartesian Product of P_n with Circulant Graph C(10,2)
循环图C(10,2)与路P_n的笛卡尔积的交叉数