A survey of the theory of hypercube graphs 281 two properties, thickness and coarseness, are defined by the planar subgraphs of a graph. An updated table of binaryternary mixed covering codes. Intro to hypercube graphs ncube or kcube graphs graph theory, hypercube graph duration. Every median graph is an isometric subgraph of a hypercube, and can be formed as a retraction of a hypercube. A clique matching in the kary ndimensional cube hypercube is a collection of disjoint one dimensional faces. A clique matching is called perfect if it covers all vertices of the hypercube.
V the cutset subspace of g, and find its dimension. N, the complete bipartite graph k m, n is a bipartite graph where v 1 m, v 2 n, and e v 1,v 2v 1. Graphs that are 3regular are also called cubic cubic. Journal of graph theory, volume 56, issue 2, 2007, 5148. In geometry, a hypercube is an ndimensional analogue of a square n 2 and a cube n 3. Graph theory frank harary an effort has been made to present the various topics in the theory of graphs in a logical order, to indicate the historical background, and to clarify the exposition by including figures to illustrate concepts and results. Much of the material in these notes is from the books graph theory by reinhard diestel and. This book is intended as an introduction to graph theory. In graph theory, the hypercube graph qn is the graph formed from the vertices and edges of an ndimensional hypercube. Pdf let g be a graph that is a subgraph of some ndimensional. On the doublepancyclicity of augmented cubes request pdf. Length 4 binary strings join strings di ering in exactly one bit generalizes 3d cube 0001 0010 0100 0111 1011 1101 1110 0000 1111 1010 0101 0011 1100 eigenvalues.
Maximal independent sets in the covering graph of the cube. In geometry, a hypercube is an n dimensional analogue of a square n 2 and a cube n 3. The adjacency matrix ag of an undirected graph g with n vertices. It is easy to draw q5 in the plane with 56 crossings. For example, in q3, the vertices 1, 0, 0 and 1, 0, 1 are adjacent because they differ only in. A catalog record for this book is available from the library of congress. On some infinite series of maximal subgroups of alternating groups, voprosi teorii grypp i gomologicheskoi algebri. It is a closed, compact, convex figure whose 1skeleton consists of groups of opposite parallel line segments aligned in each of the spaces dimensions, perpendicular to each other and of the same length. Pdf on perfect dominating sets in hypercubes and their.
560 1553 1656 51 650 299 200 1506 578 288 739 444 948 40 850 835 1019 1166 102 956 761 178 278 1490 917 533 779 634 691