Connectivity and Hamiltonian Connectedness of Graphs  

作　　者：朱永津 王中兴 

机构地区：[1]Institute of Systems Science, Academia Sinica, Beijing 100080, PRC [2]Department of Mathematics, Guangxi University, Nanning 530004, PRC

出　　处：《Chinese Science Bulletin》1993年第1期15-18,共4页

基　　金：This work was supported partially by the National Natural Science Foundation of China, and also partially by the Laboratory of Institute of Mathematics, Academia Sinica, Beijing.

摘　　要：1 Introduction In this note we consider simple graphs only, following Bondy and Murty for basic graph-theoretic notations and terminology. In addition, we set G_n^k={G|G is a k-connected graph of order n}, H_c={G|G is a Hamiltonian connected graph}, and denote by P_H(u,v)a Hamiltonian u-v path. A path P in a graph G is called a dominating path if every edge of G has at least one of its end vertices on P. α and K denote the independence number and connectivity of G.

关 键 词：CONNECTIVITY INDEPENDENT NUMBER HAMILTONIAN graph. 

分 类 号：N[自然科学总论]