|
No.
|
Name
|
Title of Thesis
|
Defense
|
Degree
|
|
1
|
Liu
Hong-Fang
|
Broadcasting
problems in networks
|
1996.06.04
|
M.S
|
|
2
|
Yang
Xiu-Wen
|
Bisection
width of toroidal and diagonal mesh
|
1996.06.04
|
M.S
|
|
3
|
Tao
Ying-Feng
|
Restricted
length paths of networks
|
2002.06.10
|
M.S
|
|
4
|
Xu
Ke-Li
|
On
Some Problems in the Analysis of Topological Structure of Networks
|
2002.06.10
|
M.S
|
|
5
|
Xie
Xin
|
On
Fault-Tolerant and Wide Diameter of Graph and (d, k)-Independence
Numbers of Hypercubes
|
2003.11.13
|
M.S
|
|
6
|
Deng Zhi-Guo
|
On Some Problems in the Analysis
of Topological Structure of Networks
|
2004.06.15
|
M.S
|
|
7
|
Xu
Min
|
The forwarding index of networks
|
2004.12.13
|
Ph.D
|
|
8
|
Zhu Qiang
|
On the Fault Tolerance and Restricted Diagnosability of
Networks
|
2005.06.03
|
Ph.D
|
|
9
|
Lv Min
|
Study on Super Connectivity of Networks
|
2005.06.03
|
Ph.D
|
|
10
|
Sun Li
|
On Some Problems of Networks
|
2005.06.03
|
M.S
|
|
11
|
Wang Yan-hui
|
Minimum Feedback Vertex Sets in Networks
|
2005.06.03
|
M.S
|
|
12
|
Ma Mei-jie
|
Study on Pancyclicity and
Panconnectivity of Networks
|
2005.11.25
|
Ph.D
|
|
13
|
Tian Fang
|
On Distance Domination Numbers of Graphs
|
2005.11.25
|
Ph.D
|
|
14
|
Alaa
Amer Najim
|
On the Edge Addition and Deletion of Graphs
|
2006.05.22
|
Ph.D
|
|
15
|
Du Zhenzhong
|
On Paths and Cycles Embedding of Fault-tolerant Networks
|
2006.05.26
|
Ph.D
|
|
16
|
Pan
Xiang-Feng
|
On Some Problems of Graph Theory in Chemistry and Networks
|
2006.05.26
|
Ph.D
|
|
17
|
Wu Yezhou
|
Feedback Numbers of Line Graphs
|
2006.06.01
|
M.S
|
|
18
|
Zhou Minjie
|
On Edge-pancyclicity and Hamltonian of Twisted Cubes
|
2006.06.01
|
M.S
|
|
19
|
Huang Jia
|
On Domination-Stability of Graphs
|
2007.06.02
|
Ph.D
|
|
20
|
Yang Chao
|
Connectivity and Fault-Diameter of Product Graphs
|
2007.06.02
|
Ph.D
|
|
21
|
Luo Wei
|
The Strong Rabin Number of Augmented Cubes
|
2007.06.04
|
M.S
|
|
22
|
Wang Weiwei
|
On Fault-Tolerance of Networks
|
2007.06.04
|
M.S
|
|
23
|
Chang Qinyan
|
On Fault-Tolerant Pancyclicity of Networks
|
2007.06.04
|
M.S
|
|
24
|
Liu Jianwei
|
The Optimization model and Application
of Portfolio on Dynamic Asset/Liability Management
|
2007.06.04
|
M.S
|
|
25
|
Zhang Guoxing
|
Research on Decision-making Models
before Airborne Amphibious Operation
|
2007.06.04
|
M.S
|
|
26
|
Hu Qing
|
On addition of edges of graphs
|
2008.06.11
|
M.S
|
|
27
|
JIng Jin
|
On Embedding of Some Fault-tolerant
Networks
|
2009.05.31
|
Ph.D
|
|
28
|
Cao Yongchang
|
Research on the Stability of Graphs
|
2009.05.31
|
Ph.D
|
|
29
|
Liang
Hao
|
Laplace Matrix and Critical Group of a
Graph
|
2009.05.31
|
Ph.D
|
|
30
|
Jiang Zhihua
|
The Distance Domination Numbers of
Generalized De Bruijn and Kautz Graphs
|
2009.06.09
|
M.S
|
|
31 |
Wang
Hai-Liang |
Fault-tolerant Panconnectivity of Hypercubes |
2009.12.09 |
Ph.D
|
|
32 |
Wang
Jian-Wei |
Some Problems in Fault-Tolerant Networks |
2010.06.03 |
Ph.D |
|
33 |
Wang
Jian |
On Critical Groups of Graphs |
2010.06.03 |
Ph.D |
|
34 |
Lu
You |
On Domination Theory of Graphs |
2010.06.03 |
Ph.D |
|
35 |
Yang Yu-Jie |
Fault-telorant Pancyclity and Panconnectivity of Folded
Hypercubes |
2010.05.26 |
M.S |
|
36 |
Li Ning |
On Domination Problem of Graphs |
2011.06.06 |
Ph.D |
|
37 |
Lin We-Jie |
On the Randic index of Some Graphs |
2011.06.10 |
M.S |
|
38 |
Hu Fu-Tao |
On the Bondage Numbers of Graphs |
2012.05.18 |
Ph.D |
|
39 |
Wang Ying |
Connected Domination Critical Problem |
2012.05.22 |
M.S |
|
40 |
Li Yun-Hua |
Fault Tolerant Arc Forwarding Index of Enhanced
Hypercubes |
2012.05.22 |
M.S |
|
41 |
Jia You |
Preflow Algorithm to the Max-Flow Problem |
2012.05.22 |
M.S |
|
42 |
Zhang Chong |
The Longest Cycle Embedding of Fault-tolerant Hypercubes |
2012.05.22 |
M.S |
|
43 |
Li Xiang-Jun |
Fault-Tolerant Analysis of Some Networks |
2013.05.18 |
Ph.D |
|
44 |
Cao Jin |
On Embedding of Cycles and Paths in Verietal Hypercubes |
2013.05.23 |
M.S |
|
45 |
Xiao Li |
On Transitivity of Varietal Hypercubes |
2013.05.23 |
M.S |
|
46 |
Hon Zhen-Mu |
On Reliability and Efficiency of Some Networks |
2014.05.22 |
Ph.D |
|
47 |
Li Jia-Ao |
Nowhere-zero 5-flow and Related Problems |
2014.05.23 |
M.S |
|
48 |
Zhang Kun-Jian |
Diameters of Altered Graphs with Related
Problems |
2014.05.23 |
M.S |
|
49 |
Liu Chang |
On Existence Problems of Total Domination
Vertex Critical Graphs |
2014.05.23 |
M.S |
|
50 |
Zhang Juan |
Edge fault Tolerance of Hypercube and Folded
Hypercube |
2014.05.23 |
M.S |
|
51 |
Chen Guang-Yong |
Distance Domination and Bondage of Graphs |
2014.05.23 |
M.S |
|
52 |
Xia Zheng-Jiang |
On Pebbling Graphs |
2015.05.31 |
Ph.D |
|
53 |
Huang Yan-Yun |
k-distance Domination Number of Some Graphs |
2015.05.31 |
M.S |
|
54 |
He Wei-Hua |
Some Hamilton problems in graphs |
2015.10.30 |
Ph.D |
|
No.
|
Name
|
Title of Thesis
|
Defense
|
Degree
|
|
1
|
Pan
Guo-Zhong
|
Some
results on arithmetic Graphs
|
1991.06.11
|
B.S
|
|
2
|
Li
Zhan-Zong
|
Some
results on arithmetic Graphs
|
1991.06.11
|
B.S
|
|
3
|
Shen, Jian
|
Arithmetic
Graphs
|
1991.06.11
|
B.S
|
|
4
|
Shen, Shuo
|
Minimum
Diameter of Path Adding 4 Edges
|
2000.06.11
|
B.S
|
|
5
|
Fu, An
|
Routings
of Strongly Connected Digraphs
|
2001.06.13
|
B.S
|
|
6
|
Yin
Zhi-Jun
|
Construction
of Infinite Families of 2-Tight Optimal Double loop
Networks
|
2001.06.13
|
B.S
|
|
7
|
Li Shao-Hua
|
Maximum
Fault-Tolerant Diameter of (t+1)-Edge- Connected Graphs
|
2001.06.13
|
B.S
|
|
8
|
Li Lei |
Restricted
Edge-Connectivity of Vertex-Transitive Graphs
|
2001.06.13
|
B.S
|
|
9
|
Xing Gang
|
Fault-Tolerant
Diameter of Undirected de Bruijn Graphs
|
2001.06.13
|
B.S
|
|
10
|
Du zheng-Zhong
|
Fault-Tolerant
Diameter of Undirected de Bruijn Graphs
|
2001.06.13
|
B.S
|
|
11
|
Jin
Jin
|
Edge-fault-tolerant
diameter of networks
|
2002.06.12
|
B.S
|
|
12
|
Zhou
Min-Jie
|
Relationship
of connectivity between graphs and line graphs |
2002.06.12
|
B.S
|
|
13
|
Wu
Yu-Yi
|
On
restricted edge-connectivity of transitive graphs |
2002.06.12
|
B.S
|
|
14
|
Cui
Li-Wei
|
On
wide-diameter of regular graphs
|
2002.06.12
|
B.S
|
|
15
|
Chen
Pen
|
Some
results on altered graphs
|
2002.06.12
|
B.S
|
|
16
|
Cun
Yu
|
Existence
of some (d, k)-Moore graphs
|
2002.06.12
|
B.S
|
|
17
|
Luo
Wei
|
Fault-tolerance
of pyramid networks
|
2002.06.12
|
B.S
|
|
18
|
Zhang
Tao-Ye
|
Edge-connectivity
of some line graphs
|
2002.06.12
|
B.S
|
|
19
|
Pen
Jian
|
On
some results of Line graphs
|
2002.06.12
|
B.S
|
|
20
|
Liu Qi
|
An infinite family of 4-tight
optimal double loop networks
|
2003.06.13
|
B.S
|
|
21
|
Cheng Guangliang
|
Topological properties of the
crossed cubes
|
2003.06.13
|
B.S
|
|
22
|
Zhu Mingfu
|
The connectivity of UB(d,2)
|
2003.06.13
|
B.S
|
|
23
|
Zhao Haiyan
|
On fault-tolerant diameter and wide
diameter of graphs
|
2003.06.13
|
B.S
|
|
24
|
Wu Yezhou
|
Algorithm analysis of fault-tolerant
diameter of networks
|
2003.06.13
|
B.S
|
|
25
|
Du Zaichao
|
Forwarding index of 2-connected
graphs
|
2003.06.13
|
B.S
|
|
26
|
Yan Chao
|
The connectivity of cartesian
products
|
2003.06.13
|
B.S
|
|
27
|
Liu Gao
|
On forwarding index of networks
|
2003.06.19
|
B.S
|
|
28
|
Dai Lijie
|
Algorithm analysis of fault-tolerant
diameter of networks
|
2003.06.19
|
B.S
|
|
29
|
Xiong Tao
|
On edge-fault-tolerant diameters
|
2003.06.19
|
B.S
|
|
30
|
Huang Jia
|
Vertex-transitivity on crossed cubes
of lower order
|
2003.06.19
|
B.S
|
|
31
|
Zhang Maolin
|
On properties of line graphs
|
2003.06.19
|
B.S
|
|
32
|
Wang Hailiang
|
Connectivity of graphs with small
girth
|
2003.06.19
|
B.S
|
|
33
|
Chen Zhi
|
Some results on Hoffman numbers
|
2004.06.21
|
B.S
|
|
34
|
Kong Wei
|
(n,k)-star graphs
|
2004.06.21
|
B.S
|
|
35
|
Li Shuijing
|
On four color theorem
|
2004.06.21
|
B.S
|
|
36
|
Cai Yongchang
|
Average distance and k-independent
sets
|
2004.06.21
|
B.S
|
|
37
|
Jiang Fan
|
3-apnner problems of folded cubes
|
2004.06.21
|
B.S
|
|
38
|
Zhou Jianguang
|
Feedback Vertex set in Folder Hypercubes
|
2005.06.11
|
B.S
|
|
39
|
Xu Fei
|
On Diameters of Altered Graphs
|
2005.06.11
|
B.S
|
|
40
|
Zhou Wei
|
Influence of
Edge-Deletion on Diameter of Graphs
|
2005.06.11
|
B.S
|
|
41
|
Li Liangde
|
The Problem
of Minimum-Cost Maximum-Flow
|
2005.06.12
|
B.S
|
|
42
|
Yuan Ye
|
Minimum Cut-sets in Folded Hypercubes
|
2005.06.12
|
B.S
|
|
43
|
Ren Xuan
|
The
Discussion of Menger's Theorem and Relative Extension
|
2005.06.12
|
B.S
|
|
44
|
Ren Zhengjiao
|
Edge-deletion problem of graphs with diameter three
|
2006.6.10
|
B.S
|
|
45
|
Lu Yongjin
|
Integral graphs and integral circulant graphs
|
2006.6.10
|
B.S
|
|
46
|
Li
Lei
|
On diameter of graphs
|
2006.6.10
|
B.S
|
|
47
|
Jiao Yang
|
A method for estimating nontrivial minimum cuts
|
2006.6.10
|
B.S
|
|
48
|
Tang Yuanyuan
|
Decreasing the diameter of cycles
|
2006.6.10
|
B.S
|
|
49
|
Liu Sijia
|
On diameter of altered graphs
|
2006.6.10
|
B.S
|
|
50
|
Liao Xiaoping
|
On wide-diameter of Cartesian product graphs
|
2006.6.10
|
B.S
|
|
51
|
Liu Dongwen
|
On the bondage number of graphs
|
2006.6.10
|
B.S
|
|
52
|
Zhang Jinghe
|
On diameter of graphs
|
2006.6.10
|
B.S
|
|
53
|
Liu Zhiyu
|
An algorithm for the minimum cost flow and complexity
|
2006.6.10
|
B.S
|
|
54
|
Wan Jia
|
On the feedback number of hypercubes
|
2006.6.10
|
B.S
|
|
55
|
Huang Liquan
|
Discussions on Diameter of Altered
Graphs
|
2007.6.15
|
B.S
|
|
56
|
Ye Hexi
|
Diameter Vulnerability of Graphs
|
2007.6.15
|
B.S
|
|
57
|
Chen Yuanting
|
The Forwarding Index of Connected
Graphs
|
2007.6.15
|
B.S
|
|
58
|
Liu Xiao
|
Decreasing the Diameter of Cycles
|
2007.6.15
|
B.S
|
|
59
|
Kong Li
|
On Decreasing Diameter of Graphs
|
2007.6.15
|
B.S
|
|
60
|
Liu Kuo
|
Researches on Path Graphs
|
2007.6.15
|
B.S
|
|
61
|
Sun
Xian-Min
|
Decycling
number of cubic graphs
|
2008.6.13
|
B.S
|
|
62
|
He
Wei-Hua
|
Decycling
number of Cartesian of cycles
|
2008.6.13
|
B.S
|
|
63
|
Teng
Ming-Fei
|
On
edge addition and diameter decrease
|
2008.6.13
|
B.S
|
|
64
|
Huang
Rui-Tong
|
Decreasing
diameter of bounded degree graphs
|
2008.6.13
|
B.S
|
|
65
|
Yan
Yin
|
On
the fault-tolerant problems
|
2008.6.13
|
B.S
|
|
66
|
Cai Nan
|
Theory of Optimal Sequencing
|
2009.6.13
|
B.S
|
|
67
|
Wang Rui-Dong
|
Diameter of Altered Graphs
|
2009.6.13
|
B.S
|
|
68
|
Jia You
|
Diameter of Altered Graphs
|
2009.6.13
|
B.S
|
|
69
|
Gong Cheng
|
he Minimum Feedback Vertex Set of Augment Cubes
|
2009.6.13
|
B.S
|
|
70
|
Peng Xu-Lu
|
Hoffman Number and Laplacian Spectrum of Graphs
|
2009.6.13
|
B.S
|
|
71
|
Yang Yi
|
Bondage Numbers of Symmetrical Directed Paths and
Cycles
|
2009.6.13
|
B.S
|
|
72
|
Hua Miao
|
Distance Domination Numbers of de Bruijn Digraphs and
Kautz Digraphs
|
2009.6.13
|
B.S
|
|
73 |
Su Hao |
Fault-tolerant Panconnectivity of Augmented Cubes |
2010.6.12
|
B.S
|
|
74 |
Zheng Ze-Min |
Bondage Number of Planar Graphs |
2010.6.12
|
B.S
|
|
75 |
Wang Jing |
Dunbar's Conjecture for Planar Graphs |
2010.6.12
|
B.S
|
|
76 |
Duan Jia-Wang |
An Effective Method to Decrease Diameter of Graphs |
2010.6.12
|
B.S
|
|
77 |
Ni Hui-Xi |
2-Retricted Edge-Connectivity of Vertex-Transitive
Graphs
|
2011.6.11 |
B.S
|
|
78 |
Zhang Chi |
A Computation Approach To Edge
Addition Problem |
2011.6.11 |
B.S
|
|
79 |
Liu Bo-Rui |
Longest Cycle Embedding in
Hypercubes with fault Vertices |
2011.6.11 |
B.S
|
|
80 |
Xiao Chang |
Lower Bounds of Restricted
Edge-Connectivity of Regular Graphs |
2011.6.11 |
B.S
|
|
81 |
Liu Bin |
Many to May Disjoint Paths in Hypercubes with Faulty
vertices
|
2011.6.11 |
B.S
|
|
82 |
Li Hao |
A Note on Existence of the Total
Domination Vertex Critical Graphs |
2011.6.11 |
B.S
|
|
83 |
Guo Wei
|
Fault-tolerance of Mobius Cubes
|
2011.6.11 |
B.S
|
|
84 |
Song Ya-Xing
|
Fault-tolerant Analysis of Augmented
Cubes |
2011.6.11 |
B.S
|
|
85 |
Xia Dong
|
(2,k)-domination
of Hypercubes |
2011.6.11 |
B.S
|
|
86 |
Chen Li
|
Bondage Number of Cubic Planar Graphs |
2012.6.05 |
B.S
|
|
87 |
Cheng Xiao-Qing
|
The improvement and a application of
Max-Flow algorithm |
2012.6.05 |
B.S
|
|
88 |
Li Jia-Ao
|
On the existence of 3-cycles |
2012.6.05 |
B.S
|
|
89 |
Liu Chang
|
On the existence problem of total
domination vertex critical graphs |
2012.6.05 |
B.S
|
|
90 |
Su Ting
|
Bondage number of some planar graphs |
2012.6.05 |
B.S
|
|
91 |
Peng Cheng
|
On
diameters of altered graphs by adding 4-5 edges |
2012.6.05 |
B.S
|
