J4

• • 上一篇    下一篇

两类非连通图(P2∨Kn∪St(m)及P2∨Kn ∪Tn的优美性

潘 伟1, 路 线2   

  1. 1. 吉林大学数学学院, 长春 130012; 2. 吉林工程技术师范学院, 长春 130052
  • 收稿日期:2002-12-11 修回日期:1900-01-01 出版日期:2003-04-26 发布日期:2003-04-26
  • 通讯作者: 潘 伟

The Gracefulness of Two Kinds of Unconnected Graphs(P2∨Kn)∪St(m) and (P2∨Kn)∪T n

PAN Wei1, LU Xian2   

  1. 1. College of Mathematics, Jilin University, Changchun 130012, China; 2. Jilin Teachers’ Institute of Engineering and Technology, Changchun 130052, China
  • Received:2002-12-11 Revised:1900-01-01 Online:2003-04-26 Published:2003-04-26
  • Contact: PAN Wei

摘要: 对自然数n,m,i∈N, 设Ki表示i个顶点的完全图, Kn 是Kn的补图, St(m)表示m+1个顶点的星形树, Tn为n个节点的优 美树, Pn为n个节点的路, P2∨Kn是P2 与Kn联图. 给出非连通图(P2∨Kn)∪St(m)和(P2 ∨Kn∪Tn, 并论证了当n≥2时, 这两类图都是优美图.

关键词: 简单图, 非连通图, 优美图

Abstract: For natural numbers n,m,i∈N, let Ki be an i-vertex complet e graph, Kn is the complementay graph of graph Kn, St(m) represents a m+1-vertex star tree, Tn is a n-vertex tree, Pn is a n-vertex path, P2∨Kn is the join graph of P2 and Kn. The present paper presents two kinds of unconne cted graphs (P2∨Kn)∪St(m) and (P2∨Kn)∪Tn, and proves that the two kinds of graphs are graceful graph s when n≥2.

Key words: simple graph, unconnectd graph, graceful graph

中图分类号: 

  • O157.9