期刊文献+

图的广义字典序积的强不可缩回性

Strong unretractive property of generalized lexicographic product of graphs
下载PDF
导出
摘要 通过对图的广义字典序积的强不可缩回性的讨论 ,得到了如下结果 :若对每个x∈V(X) ,图Yx 是非平凡的连通图 ,则X[Yx x∈V(X) ]是强不可缩回的充要条件是每个Yx 都是强不可缩回的 ;若对每个x∈V(X) ,图Yx 有两个连通分支 ,其中恰有一个分支是孤立点 ,则X[Yx x∈V(X) ]是强不可缩回的充要条件是每个Yx 及X都是强不可缩回的 . Strong unretractive property of generalized lexicographic product of graphs is discussed.Two results are obtained:If every Y x is nontrivial connected graph,then X[Y xx∈V(X)] is strong unretractive if and only if every Y x is strong unretractive;If every Y x has exactly one isolated vertex and has just two connected components,then X[Y xx∈V(X)] is strong unretractive if and only if every Y x and X are strong unretractive.
作者 陈祥恩
出处 《西北师范大学学报(自然科学版)》 CAS 2000年第4期14-18,共5页 Journal of Northwest Normal University(Natural Science)
关键词 广义字典序积 强自同态 强同态 强不可缩回性 generalized lexicographic product strong endomorphism strong homomorphism strong unretractive
  • 相关文献

参考文献4

  • 1[1] Harary F.Graph Theory[M].New York:Addison-Wesley,Academic Press,1967.
  • 2[2] Knauer U,Nieporte M.Endomorphisms of graphs,Ⅰ.The monoid of strong endomorphisms[J].Arch Math,1989,52:607—614.
  • 3[3] Knauer U.Unretractive and S-unretractive joins and lexicographic products of graphs[J].J Graph Theory,1987,11(3):429—440.
  • 4[4] Knauer U.Endomorphisms of graphs,Ⅱ.Various unretractive graphs[J].Arch Math,1990,55:193—203.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部