N. Hartsfield and G. Ringel. Pearls in Graph Theory. Academic Press.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....if V V , E E and all the relationships of G are preserved. Definition 7. A subgraph H = V ) of G = V; E) is called a 1 factor of G if V = V and the degree of every vertex of H is exactly 1. Two graphs are said to be edge disjoint if they have no edges in common. Corollary 8. [7] K 2p can be decomposed into (2p Gamma 1) edge disjoint 1 factors H 1 = V; E 1 ) H 2p Gamma1 = V; E 2p Gamma1 ) The proof of Proposition 6 provides an algorithm which decomposes K 2p into (2p Gamma 1) edge disjoint 1factors. For example, K 8 is decomposed into seven edge disjoint ....

....1) SAC function and an (8; 4; 2) SAC function by using the method of Sect. 4.2. Basic functions of n = 8 are as follows (see Fig. 1) f 7 = x 1 x 2 Phi x 3 x 7 Phi x 4 x 6 Phi x 5 x 8 : 6 F (x 1 ; x 8 ) f 7 ) is an (8; 7; 0) SAC function. A generator matrix of a linear [7,6,2] code is given by Q = I 6 ; J) where I 6 is the 6 Theta 6 identity matrix and J = 1; 1) Let (f 1 ; f 6 ) Q( f 1 ; f 7 ) Then f 1 = f 1 Phi f 7 ; f 2 = f 2 Phi f 7 ; f 3 = f 3 Phi f 7 ; f 4 = f 7 : Now, F (x 1 ; x 8 ) f 1 ; ....

[Article contains additional citation context not shown here]

N. Hartsfield and G. Ringel. Pearls in Graph Theory. Academic Press.

....geometric introduction. We expect that the reader is familiar with concepts such as group, graph, matrix, and permutation, but we do not require any advanced knowledge of any of these topics. We do not give any rigorous definition of surface or map on a surface. Books listed among our references, [5, 6, 7, 8, 11, 13, 14, 15, 18, 28, 29, 31, 32, 35, 37, 59, 66, 67, 68] provide a spectrum of bacground material spanned Work supported in part by the grants J1 6161 and J26193 of Ministry of Science and Technology of Slovenia. between motivating and introductory chapters for general readership and ranging up to advanced and rigorous monographs that can be used as ....

....shown that all benzenoid graphs can be described as unit sphere graphs in 2D. A graph is called a benzenoid graph 1 if it can be obtained by selecting a connected subset of hexagons in an infinite planar hexagonal lattice (representing graphite) Example 3 Touching coins and touching pennies, [31]. Given a set of coins c 1 ; c 2 ; c n in the plane, we may define the graph that has the n vertices in the centers of c 1 ; c 2 ; c n and the i th and j th vertices are adjacent if and only if the coins c i and c j touch. In 1935 it was shown by Koebe that any planar graph can be ....

N. Hartsfield and G. Ringel. Pearls in Graph Theory, Revised Edition. Academic Press, New York, 1994.

....tree on U does not have more than # n 2 # end vertices. Moreover, we shall prove that given a set U of n points in the plane, there exists a geometric independency tree T on U such that T has at least n 6 end vertices. All notation and terminology not explained here are given in [3]. 2 Characterizations of geometric independency trees with two and three end vertices Let conv(U) be the convex hull of a set U of points in the plane, which is the smallest convex set containing U . Denote by #U the set of points of U lying on the boundary of conv(U ) A point of U which is not ....

N. Hartsfield and G. Ringel, Pearls in Graph Theory, Academic Press, Inc. 1994.

....solution to this constraint To answer this, and to reveal the algorithm for computing it, we will first introduce some terminology. A matching in a bipartite graph is a set of edges with no nodes in common. A maximal matching in a bipartite graph is a matching with as many edges as possible [HR90]. In our case we will require that every left hand side node is covered by exactly one such edge and that every right hand side node are covered by at most one such edge. These edges are called matched. Nodes that are covered are also called matched and those that are not matched are called ....

Nora Hartsfield and Gerhard Ringel. Pearls in Graph Theory. A Comprehensive Introduction. Academic Press, Boston, 1990.

....any element of the sequence of cubic trees can be inserted by an appropriately chosen series of edge insertions; we will speak freely therefore of inserting cubic trees into 3 regular graphs. 3 The Cages A number of cubic cages are known, and have been described in many places: see, for example [Tut66, HR90]. The 3 cage and 4 cage are trivial: the tetrahedron and K 3;3 ; respectively. The 5 cage is the Petersen graph. The 6 cage has 14 vertices and is called the Heawood graph [Tut66] The 7 cage, with 24 vertices, is called the McGee graph [Tut66] The 8 cage has 30 vertices and is variously known ....

....and K 3;3 ; respectively. The 5 cage is the Petersen graph. The 6 cage has 14 vertices and is called the Heawood graph [Tut66] The 7 cage, with 24 vertices, is called the McGee graph [Tut66] The 8 cage has 30 vertices and is variously known as the Levi graph [CM78] or the Tutte Coxeter graph [HR90]. 3.1 Insertions Into Connected Graphs We begin by displaying a collection of insertions that build the cubic cages from the tetrahedron on up. Theorem 3.1 The following cubic tree insertion tables relate cubic cages: t 0 t 1 t 2 t 3 tetrahedron (3) K 3;3 Petersen Heawood K 3;3 (4) oct. w ....

Nora Hartsfield and Gerhard Ringel. Pearls in Graph Theory. Academic Press, 1990.

....E 0 ae = E and all the relationships of G are preserved. Definition 7. A subgraph H = V 0 ; E 0 ) of G = V; E) is called a 1 factor of G if V = V 0 and the degree of every vertex of H is exactly 1. Two graphs are said to be edge disjoint if they have no edges in common. Corollary 8. [7] K 2p can be decomposed into (2p Gamma 1) edge disjoint 1 factors H 1 = V; E 1 ) H 2p Gamma1 = V; E 2p Gamma1 ) The proof of Proposition 6 provides an algorithm which decomposes K 2p into (2p Gamma 1) edge disjoint 1factors. For example, K 8 is decomposed into seven edge disjoint ....

....x 4 x 7 Phi x 5 x 6 ; f 7 = x 1 x 2 Phi x 3 x 7 Phi x 4 x 6 Phi x 5 x 8 : 6 IEICE TRANS. VOL. E90, NO. 1 JANUARY 1998 ffl (8; 7; 0) SAC function F (x 1 ; x 8 ) f 1 ; f 7 ) is an (8; 7; 0) SAC function. ffl (8; 6; 1) SAC function A generator matrix of a linear [7,6,2] code is given by Q = I 6 ; J) where I 6 is the 6 Theta 6 identity matrix and J = 1; 1) T . Let (f 1 ; f 6 ) T = Q( f 1 ; f 7 ) T : Then f 1 = f 1 Phi f 7 ; f 2 = f 2 Phi f 7 ; f 3 = f 3 Phi f 7 ; f 4 = f 4 Phi f 7 ; f 5 = f 5 Phi f 7 ; f ....

[Article contains additional citation context not shown here]

N. Hartsfield and G. Ringel. Pearls in Graph Theory. Academic Press.

....Appendix. ut A graph H = V 0 ; E 0 ) is a subgraph of G if V 0 V , E 0 E and all the relationships of G are preserved. Definition 7. A subgraph H = V 0 ; E 0 ) of G = V; E) is called a 1 factor of G if V = V 0 and the degree of every vertex of H is exactly 1. Corollary 8. [7] K 2p can be decomposed into (2p Gamma 1) edge disjoint 1 factors H 1 = V; E 1 ) Delta Delta Delta ; H 2p Gamma1 = V; E 2p Gamma1 ) The proof of Proposition 6 provides an algorithm which decomposes K 2p into (2p Gamma 1) edge disjoint 1 factors. For example, K 8 is decomposed into seven ....

....7 Phi x 6 x 8 ; f 6 = x 1 x 3 Phi x 2 x 8 Phi x 4 x 7 Phi x 5 x 6 ; f 7 = x 1 x 2 Phi x 3 x 7 Phi x 4 x 6 Phi x 5 x 8 : 8; 7; 0) SAC function F (x 1 ; x 8 ) f 1 ; f 7 ) is an (8; 7; 0) SAC function. 8; 6; 1) SAC function A generator matrix of a linear [7,6,2] code is given by Q = I 6 ; J) where I 6 is the 6 Theta 6 identity matrix and J = 1; Delta Delta Delta ; 1) T . Let (f 1 ; Delta Delta Delta ; f 6 ) T = Q( f 1 ; Delta Delta Delta ; f 7 ) T : Then f 1 = f 1 Phi f 7 ; f 2 = f 2 Phi f 7 ; f 3 = f 3 Phi f 7 ; f 4 = ....

[Article contains additional citation context not shown here]

N. Hartsfield and G. Ringel. Pearls in Graph Theory. Academic Press.

No context found.

N. Hartsfield and G. Ringel. Pearls in Graph Theory. Academic Press, Boston, MA, 1990.

No context found.

Hartsfield, N. and G. Ringel, 1990. Pearls in Graph Theory. A Comprehensive Introduction. Academic Press, Inc., New York.

No context found.

N. Hartsfield, G. Ringel, "Pearls in Graph Theory", Academic Press, 1990.

No context found.

Hartsfield, N. and Ringel, G.: Pearls in Graph Theory, 2 nd edition. Academic Press, Boston, 1994.

No context found.

N. Hartsfield, G. Ringel, "Pearls in Graph Theory", Academic Press, 1990.

No context found.

N. Hartsfield, G. Ringel, "Pearls in Graph Theory", Academic Press, 1990.

No context found.

N. Hartsfield and G. Ringel. Pearls in Graph Theory. Academic Press, Boston, MA, 1990.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC