作者: Simon Špacapan
DOI: 10.1016/J.DISC.2013.02.011
关键词:
摘要: Abstract The direct product of graphs G = ( V ) , E and H is the graph, denoted as × with vertex set where vertices x 1 y 2 are adjacent in if ∈ . edge connectivity a graph λ size minimum edge-cut We introduce function ψ prove following formula min { | δ } also describe structure every