...
首页> 外文期刊>Journal of Combinatorial Theory, Series B >Independent sets in direct products of vertex-transitive graphs
【24h】

Independent sets in direct products of vertex-transitive graphs

机译:顶点传递图的直接乘积中的独立集

获取原文
获取原文并翻译 | 示例
           

摘要

The direct product G × H of graphs G and H is defined by V(G × H) = V(G) × V(H) and E(G × H)={[(u_1, v_1), (u_2, v_2)]: (u_1, u_2) ∈ E(G) and (v_1, v_2) ∈ E(H)}. In this paper, we will prove that α(G × H)=max{α(G)|H|,α(H)|G|} holds for all vertex-transitive graphs G and H, which provides an affirmative answer to a problem posed by Tardif (1998) [11]. Furthermore, the structure of all maximum independent sets of G × H is determined.
机译:图G和H的直接乘积G×H定义为V(G×H)= V(G)×V(H)和E(G×H)= {[(u_1,v_1),(u_2,v_2 )]:(u_1,u_2)∈E(G)和(v_1,v_2)∈E(H)}。在本文中,我们将证明α(G×H)= max {α(G)| H |,α(H)| G |}成立,对所有顶点传递图G和H都成立,从而为Tardif(1998)提出的一个问题[11]。此外,确定G×H的所有最大独立集的结构。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号