Random subgraphs of certain graph powers 外文参考文献.docVIP

PII.S0161171202201210 RANDOMSUBGRAPHSOFCERTAINGRAPHPOWERS LANECLARK Received 4March 2002 Wedetermine thelimiting probability that arandom subgraph oftheCartesian power Kan orofKa,an isconnected. 2000 Mathematics Subject Classi?cation: 05C80. 1. Introduction. A?nite,simple,undirectedgraphGhasvertexsetV(G)andedge setE(G).TheorderofGis|V(G)|andthesizee(G) ofGis|E(G)|.ForS?V(G) ,let G[S] denotethesubgraphofGinducedbyS andG[S,V(G)?S] denotethespanning subgraph of G with edges xy where x ∈ S and y ∈ V(G)?S. For U ? V(G) , let N (U) ={y ∈V(G):?xy ∈E(G) withx∈U} and N
(U) =N (U