| 全Pk-图的边连通性 |
| |
| 引用本文： | 郝琛,谭丽,庄蔚.全Pk-图的边连通性[J].广西师院学报,2013(3):8-12. |
| |
| 作者姓名： | 郝琛 谭丽 庄蔚 |
| |
| 作者单位： | [1]山西大学,山西太原030006 [2]晋中职业技术学院,山西晋中030600 [3]广西师范学院数学科学学院,广西南宁530023 [4]厦门理工学院数学系,福建厦门361024 |
| |
| 基金项目： | The research is supported by Natural Sciences Foundation of Guangxi Province （2012GXNSFBA053005） |
| |
| 摘 要： | 摘要：图G的Pk-路图P-（G）是以G的忌一长路构成的集合为点集，这两个路在P-（G）中相邻当且仅当这两个愚一长路在G中的交为一个k—I-长路且并未一个k＋1一长路或者愚一长圈时．令Ek={（v，p）：P∈V（P·（G）），v是图Pk（G）的一个顶点），定义全Pk-图TI（G）如下：Tk（G）=（v（G）UV（Pk（G）），E（G）UE（Pk（G））UEk）．该文研究全Pt-图的边连通性．
|
| 关 键 词： | 边连通度}全图 路图 全Pk-图 |
The Edge Connectivities of Total Pk-graphs |
| |
| HAO Chen,＇,TAN Li,ZHUANG Wei.The Edge Connectivities of Total Pk-graphs[J].Journal of Guangxi Teachers College(Natural Science Edition),2013(3):8-12. |
| |
| Authors: | HAO Chen ＇ TAN Li ZHUANG Wei |
| |
| Institution: | 4 (1. Shanxi University, Taiyuan 003006, China 2. Jinzhong Vocational and Technical College, Jinzhong 030600, China 3. School of Mathematical Science, Guangxi Teachers Education University, Nanning 530023, China 4. Department of Mathematics and Physics, Xiamen University of Technology, Xiamen 361024, China) |
| |
| Abstract: | The Pk-path graph Pk （G） corresponding to a graph G has for vertices the set of all paths of length k in G. Two vertices are joined by an edge if and only if the intersection of the corresponding paths forms a path of length k- 1 in G, and their union forms either a cycle or a path of length k ＋ 1. Let Ek = {（v,p）,p E V（Pk （G））, v is an end vertex of p in G}, we define total Pk-graphs Tk （G） as Yk （G） = （V（G） UV（Pk （G）） ,E（G） U E（PI （G）） U Ek ）. In this note, we introduce total P,-graphs Th （G） and study their edge connectivity, as the generaliza- tion of total graphs. |
| |
| Keywords: | edge connectivity total graph path graphl total Pk-graph |
| 本文献已被 维普 等数据库收录！ |
|
