圈图在张量积下的独立数  

Independent Number of Cycle Graph under Tensor Product

作　　者：李晨莹 LI Chen-ying(College of Mathematics and Information Engineering, Zhejiang Normal University, Jinhua 321004, China)

机构地区：[1]浙江师范大学数理与信息工程学院,浙江金华321004

出　　处：《洛阳师范学院学报》2017年第11期8-12,共5页Journal of Luoyang Normal University

摘　　要：图G_1,G_2和G_3的张量积(G_1,G_2,G_3)定义为V(G_1,G_2,G_3)=V(G_1)×V(G_2)×V(G_3),[(u_1,u_2,u_3),(v_1,v_2,v_3)]∈E(G_1,G_2,G_3)当且仅当|{i∶(u_i,v_i)∈G_i}|≥2.在本文中将证明,当G_1,G_2,G_3均为圈图时,等式α(G_1,G_2,G_3)=max{α(G_1)α(G_2)|G_3|,α(G_1)α(G_3)|G_2|,α(G_2)α(G_3)|G_1|}成立,并且还刻画了其最大独立集的结构.Tensor products(G1,G2,G3)of graphs G1,G2,and G3are defined as V(G1,G2,G3)=V(G1)×V(G2)×V(G3)[(u1,u2,u3),(v1,v2,v3)]∈E(G1,G2,G3)when and only when|{i:(ui,vi)∈Gi}|≥2.This paper demonstrates when G1,G2,and G3are cycle graphs,equationα(G1,G2,G3)=max{α(G1)α(G2)|G3|,α(G1)α(G3)|G2|,α(G2)α(G3)|G1|}can be established,and depicts the structure of its maximum independent set.

关 键 词：EKR定理 点传递 本原性 独立数 

分 类 号：O157.5[理学—数学]