Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Volume 14Utilitas Mathematica Pub, 1983 - Combinatorial analysis |
From inside the book
Results 1-3 of 4
Page 324
... Ker B B * ལ id B " . And this implies that ( B , R ) ~ ( B ' , R ) . [ id are isomorphisms of G which both If Φ and φ ' induce the same mapping π on Ker G , then for any B C G. Hence let us denote by Ker G element in the id - class of A ...
... Ker B B * ལ id B " . And this implies that ( B , R ) ~ ( B ' , R ) . [ id are isomorphisms of G which both If Φ and φ ' induce the same mapping π on Ker G , then for any B C G. Hence let us denote by Ker G element in the id - class of A ...
Page 326
... Ker G Ker G ' there is B ' CG ' Ker G ' ve V ( Ker B ' Ker G ' ) . Π we have that ' ( B ) with G ' ( B ) = v ' . Pick a vertex Then for a corresponding admissible △ ̃ ( " , G , G ' ) ≤ 1 , a contradiction to ( * ) . + = Ker G Hence ...
... Ker G Ker G ' there is B ' CG ' Ker G ' ve V ( Ker B ' Ker G ' ) . Π we have that ' ( B ) with G ' ( B ) = v ' . Pick a vertex Then for a corresponding admissible △ ̃ ( " , G , G ' ) ≤ 1 , a contradiction to ( * ) . + = Ker G Hence ...
Page 327
... G ' ∞ Let · GG ' . ( 1 ) There is BCG Ker G or BCG ' Ker G ' such that ( B , G ) ( B , G ' ) . Proof . Let G1 denote the graph that results from G after deletion of all bridges BC G for which Ker G aid ( B , G ) αia ( TB , G ...
... G ' ∞ Let · GG ' . ( 1 ) There is BCG Ker G or BCG ' Ker G ' such that ( B , G ) ( B , G ' ) . Proof . Let G1 denote the graph that results from G after deletion of all bridges BC G for which Ker G aid ( B , G ) αia ( TB , G ...
Contents
Pomerance | 21 |
J Abrham A Kotzig and P J Laufer | 45 |
O Albertson and D M Berman | 69 |
Copyright | |
17 other sections not shown
Other editions - View all
Common terms and phrases
2-extensors adjacent algorithm array bipartite blocks cograph color column Combinatorial complete complete graph component Computing configuration CONGRESSUS NUMERANTIUM conjecture construction contains Corollary corresponding cosets cycle cyclic defined denote digraph directed graph disjoint edge of H elements embedded Eulerian circuit example exists Figure finite function G₁ G₂ given Goppa codes graph G Graph Theory Hence hypergraph inequalities integer intersection irreducible isomorphic k-connected graphs k-subset Ker G labelled latin squares Lemma length Let G linear mapping Math Mathematics matrix matroid maximal maximum minimal minimum mission network nodes NP-complete obtained operations pair paper partition path perfect graphs permutation plane points polynomial problem Proof prove PSDS randomly bitraceable result satisfying sequence Southeastern Conference subgraph subset symmetric Theorem tiles Transitive triple tree triangle triple system University upper bound values variables vector vertex vertices