Kronecker积与K2的连通性
组合数学
2011-06-08 v1
摘要
设κ(G)为图G的连通度。图G1与G2的Kronecker积G1×G2的顶点集为V(G1×G2)=V(G1)×V(G2),边集为E(G1×G2)={(u1,v1)(u2,v2):u1u2∈E(G1),v1v2∈E(G2)}。本文证明κ(G×K2)=min{2κ(G),min{∣X∣+2∣Y∣}},其中第二个最小值取遍所有满足以下条件的不相交集合X,Y⊆V(G):(1)G−(X∪Y)包含一个二部连通分支C,且(2)对每个x∈X,G[V(C)∪{x}]也是二部图。
引用
@article{arxiv.1106.1255,
title = {Connectivity of Kronecker products by K2},
author = {Wei Wang and Zhidan Yan},
journal= {arXiv preprint arXiv:1106.1255},
year = {2011}
}
备注
6 pages