节点文献
一类图的cordial性
The Cordiality of a Type of Graphs
【摘要】 A表示删除2度点后的点导出子图是空图的图形,文章的结论:A不是cordial图的充要条件是A是偶度图且e(A)=4m+2.
【Abstract】 A graph that the induced subgraph by deleting the vertice-set whose degree is 2 is empty,is denoted by A.A is not cordial if and only if the degree of all vertices is even and e(A)=4m+2.
- 【文献出处】 数学研究 ,Journal of Mathematical Study , 编辑部邮箱 ,2007年04期
- 【分类号】O157.5
- 【被引频次】2
- 【下载频次】21