A survey of the theory of hypercube graphs

DOI10.1016/0898-1221(88)90213-1zbMath0645.05061OpenAlexW2054204410WikidataQ55934465 ScholiaQ55934465MaRDI QIDQ1102985

Frank Harary, John P. Hayes, Horng-Jyh Wu

Publication date: 1988

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/27522

zbMATH Keywords

survey hypercube graphs

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05C99)

Related Items

Cluster sampling for Morris method made easy, Quantum routing in planar graph using perfect state transfer, Reliability evaluation for bijection-connected networks based on the super \(P_k\)-connectivity, Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension, Extended formulations for perfect domination problems and their algorithmic implications, Hypercubes and isometric words based on swap and mismatch distance, Rigidity properties of the hypercube via Bakry-Émery curvature, On some similarity of finite sets (and what we can say today about certain old problem), Counting spanning trees in cobordism of two circulant graphs, Avoiding and extending partial edge colorings of hypercubes, Dimensionality of hypercube clusters, Structure connectivity and substructure connectivity of hypercubes, A heuristic approach for constructing symmetric Gray codes, Topes of oriented matroids and related structures, Edge fault tolerance analysis of a class of interconnection networks, Hamiltonian paths with prescribed edges in hypercubes, Sequential Monte Carlo for counting vertex covers in general graphs, Kolmogorov entropy for classes of convex functions, Data center interconnection networks are not hyperbolic, Visualizing Boolean operations on a hypercube, Quaternary \(n\)-cubes and isometric words, On the \(g\)-extra diagnosability of enhanced hypercubes, How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube?, Fault-tolerant analysis of a class of networks, Cycles passing through prescribed edges in a hypercube with some faulty edges, Vertex extensions of 4-layer graphs and hypercubes, Random walks on binary strings applied to the somatic hypermutation of B-cells, Cubical graphs and cubical dimensions, AN ATLAS OF ROBUST, STABLE, HIGH-DIMENSIONAL LIMIT CYCLES, Extension of de Bruijn graph and Kautz graph, Average consensus on networks with quantized communication, \(\{2,3\}\)-extraconnectivities of hypercube-like networks, Dense sets and embedding binary trees into hypercubes, Cluster connectivity of hypercube-based networks under the super fault-tolerance condition, A characterization of cube-hypergraphs, Using maximality and minimality conditions to construct inequality chains, Structure and Substructure Connectivity of Hypercube-Like Networks, A Remark on Rainbow 6-Cycles in Hypercubes, Edge-fault-tolerant diameter and bipanconnectivity of hypercubes, Invariants of E-graphs, The fault-diameter and wide-diameter of twisted hypercubes, Decomposition of hypercube graphs into paths and cycles of length four, Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges, Representation of finite graphs as difference graphs of \(S\)-units. I, Note on the subgraph component polynomial, Rainbow connections of graphs: a survey, A possible optimal design of one-way Hamming network \(H(n,3)\) based on the minimum transmission latency, Graphical designs and extremal combinatorics, Structure fault tolerance of hypercubes and folded hypercubes, Bipanconnectivity of faulty hypercubes with minimum degree, Efficient quantum circuits for continuous-time quantum walks on composite graphs, Planar median graphs and cubesquare-graphs, A new measure for locally \(t\)-diagnosable under PMC model, One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes, Bipartite Kneser graphs are Hamiltonian, Paired many-to-many disjoint path covers of the hypercubes, Bipartite Kneser graphs are Hamiltonian, Control of cancellations that restrain the growth of a binomial recursion, Super fault-tolerance assessment of locally twisted cubes based on the structure connectivity, Genus of the hypercube graph and real moment-angle complexes, Proper distance in edge-colored hypercubes, A scheme to construct distance-three codes using Latin squares, with applications to the \(n\)-cube, Packing the hypercube, On meshy trees, Many-to-many disjoint paths in hypercubes with faulty vertices, Express the number of spanning trees in term of degrees, Antipodal graphs and oriented matroids, On crossing numbers of hypercubes and cube connected cycles, Nonlinear piecewise polynomial approximation and multivariate \(BV\) spaces of a Wiener-L. Young type. I., Integral graphs and \((k,\tau )\)-regular sets, A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges, Cover-preserving order embeddings into Boolean lattices, Analysis of discrete bioregulatory networks using symbolic steady states, Some results on topological properties of folded hypercubes, Cayley properties of the line graphs induced by consecutive layers of the hypercube, On path bipancyclicity of hypercubes, Properties of \(\pi\)-skew graphs with applications, Hamiltonian paths and cycles passing through a prescribed path in hypercubes, Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs, Structural Properties of Generalized Exchanged Hypercubes, An analysis of root functions -- a subclass of the impossible class of faulty functions (ICFF), Paired many-to-many disjoint path covers of hypertori, Many-to-many disjoint paths in faulty hypercubes, Unnamed Item, Towards integrable structure in 3d Ising model, Subgraphs of hypercubes and subdiagrams of Boolean lattices, On the resistance diameter of hypercubes, Paired many-to-many disjoint path covers of hypercubes with faulty edges, Unnamed Item, Symmetries of Quotient Networks for Doubly Periodic Patterns on the Square Lattice, Boolean layer cakes, On the skewness of Cartesian products with trees, Counting rooted spanning forests in cobordism of two circulant graphs, Survey on path and cycle embedding in some networks, The maximum length of circuit codes with long bit runs and a new characterization theorem, Number of proper paths in edge-colored hypercubes, Logical and geometrical distance in polyhedral Aristotelian diagrams in knowledge representation, A new structure for a vertex to be locally \(t\)-diagnosable in large multiprocessor systems, Structure connectivity and substructure connectivity of twisted hypercubes, On \(k\)-ary \(n\)-cubes and isometric words, On Middle Cube Graphs, A bandwagon bias based model for opinion dynamics: Intertwining between homophily and influence mechanisms, Reverse binary graphs, Hypercubes, shuffle-exchange graphs and de Bruijn digraphs, Variations on a hypercube: Embellishments of parallel architectures, Counting Hamiltonian cycles in bipartite graphs, About uniqueness of the minimal 1-edge extension of hypercube Q4, ON THE SURFACE AREAS AND AVERAGE DISTANCES OF MESHES AND TORI

Cites Work