www.heavensgatel2.fora.pl

[px919557]

On matching equivalent graphs


Fund Project : Ministry of Education, Science Key Research Project ( 206156 ) Author : QINGHAI JUNIOR (1970) , male , Baoding, Hebei , associate professor , Master , research direction: Theory and Polynomial Figure 2 QINGHAI JUNIOR on matching equivalent Construction of 87 ((Gu A (a 1)) (H) (G) A (G ) (H y) (H) (G), by the induction hypothesis it is equal to (a (a 1) Gu) (H ) · (G) A (G ) (H y) (H) (G) a (Hv ~ ( A 1) Gu) (G) A (G ) (H y) (G) (H) While ((Hv-nGu) U (~ 1) H) a (Hv-nGu) · (H) A ((Hv a (a 1) Gu) (G) A (G ) (H y) ( G) (H), ie ((Gu-nHv) U ( a 1) G) I ( a nGu) U ( a 1) H). Using Theorem 1 and Lemma 3 we have the following results: Corollary 1 If the graph G Three Three different configurations with H = 2 , then graph (Gu-nHv) U ( a 1) G and (Hv-nGu) U ( a 1) H) and their complement are non- unique graph matching . Let G and H are two plans , UEV (G),,, ..., EV (H), if the graph G with a copy of a graph H together, and point U G, with the first i (1i) a Figure H point with the edge of the stamp is connected by : Gu-nHv ( see Figure 3). If the graph G and graph H together, and point G, the point U in Figure H ,[link widoczny dla zalogowanych], , ..., are connected by a seal with the edge as : Gu-H ... ( see Figure 4). Figure 1C-a-nltv Figure 2Hv-nGu Figure 3C-a-nIlvlv2 ... ring 4C-a-Hv, V2 ... Theorem 2 <G . prove that t ~ (Gu-nHvl2 ...) A (G 2) Hv. ... Y) · (H) ~ (G ) (H) (H 2)) (H) A (G ) (H) (H v1) a (G Hv. Y ...) (H) A (G ) (H) ((H y1) + (H vz)) a ... a (G) (H) ~ (G ) (H) (Σ (H ) ) A ((G) (H) A (G ) (Σ (H ))) (H); i-li = l and ((Gu-ly2 ...) U < A 1) H) a / ~ (Gu-ly2 ...) / 1 G ) (H vz) A (G ) (H y1)) (H) a ... a ((G) (H) A (G ) ((H y)) (H). that f ~ (Gu-nHviI) 2.) a ((Gu-HlI) 2 ...) U (~ i-l1) H). Using Theorem 2 and Lemma 3 we have the following results: Corollary 2 when ≥ 2 , the graph G