| 引用本文： |
-
郑学谦,罗海鹏,乔晓云.几类边友好图[J].广西科学院学报,2009,25(1):14-16. [点击复制]
- ZHENG Xue-qian,LUO Hai-peng,QIAO Xiao-yun.Several E-cordial Graphs[J].Journal of Guangxi Academy of Sciences,2009,25(1):14-16. [点击复制]
|
|
| 摘要: |
| 证明n-荷兰风车和Dn,4是边友好图,并且给出梯图Ln是边友好图的充要条件以及一阶网图F(1,n)是边友好图的充分条件. |
| 关键词: 边友好图 n-荷兰风车 梯图Ln 网图F(1,n) |
| DOI： |
| 投稿时间：2008-10-12 |
| 基金项目:国家自然科学基金项目(60563008)和广西自然科学基金项目(桂科自0728051)资助。 |
|
| Several E-cordial Graphs |
|
ZHENG Xue-qian1, LUO Hai-peng2, QIAO Xiao-yun3
|
| (1.Mathematics and Electronics Department, Shanxi University Bussiness College, Taiyuan, Shanxi, 030031, China;2.Guangxi Academy of Sciences, Nanning, Guangxi, 530007, China;3.Department of Mathematics and Computer Science, Guangxi Teachers Education University, Nanning, Guangxi, 530023, China) |
| Abstract: |
| n-dutch windmills and Dn,4 are proved to be E-cordial graphs.The necessary and sufficient conditions of E-cordial graphs of ladder Ln and the sufficient condition of E-cordial graphs of net graph F(1,n) is given. |
| Key words: E-cordial graphs n-dutch windmills ladder graph Ln net graph F(1,n) |
