On potentially H-graphic sequences |
| |
Authors: | Meng-Xiao Yin Jian-Hua Yin |
| |
Affiliation: | (1) College of Computer and Electronics Information, Guangxi University, Nanning, Guangxi, 530004, China;(2) Department of Applied Mathematics, College of Information Science and Technology, Hainan University, Haikou, Hainan, 570228, China |
| |
Abstract: | For given a graph H, a graphic sequence π = (d 1, d 2,..., d n) is said to be potentially H-graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize the potentially (K 5 − e)-positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence π to be potentially K 5-graphic, where K r is a complete graph on r vertices and K r-e is a graph obtained from K r by deleting one edge. Moreover, we also give a simple necessary and sufficient condition for a positive graphic sequence π to be potentially K 6-graphic. Project supported by National Natural Science Foundation of China (No. 10401010). |
| |
Keywords: | graph degree sequence potentially H-graphic sequence |
本文献已被 SpringerLink 等数据库收录! |
|