A survey of the theory of hypercube graphs
From MaRDI portal
DOI10.1016/0898-1221(88)90213-1zbMATH Open0645.05061OpenAlexW2054204410WikidataQ55934465 ScholiaQ55934465MaRDI QIDQ1102985FDOQ1102985
Authors: 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
Recommendations
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05C99)
Cites Work
- Parallel concepts in graph theory
- A Graph Model for Fault-Tolerant Computing Systems
- Towards a theory of domination in graphs
- Title not available (Why is that?)
- Convexity in graphs
- On Hamiltonian circuits and spanning trees of hypercubes
- Title not available (Why is that?)
- On cubes and dichotomic trees
- On cubical graphs
- Title not available (Why is that?)
- $B$-valuations of graphs
- Über drei kombinatorische Probleme am \(n\)-dimensionalen Würfel und Würfelgitter
- The Genus of the n-Cube
- Cospectral Graphs and Digraphs
- One-legged caterpillars span hypercubes
- Proof of the squashed cube conjecture
- The starlike trees which span a hypercube
- A characterization of hypercubes
- A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\)
- Embedding the polytomic tree into the $n$-cube
- Title not available (Why is that?)
- Title not available (Why is that?)
- Another characterization of hypercubes
- Bounds on the number of Hamiltonian circuits in the n-cube
- On the Number of Hamiltonian Circuits in the n-Cube
- Embedding the dichotomic tree into the $n$-cube
- A characterization of the n-cube by convex subgraphs
- Smallest maximal matchings in the graph of the d-dimensional cube
- On quasistars in $n$-cubes
- Maximum versus minimum invariants for graphs
- Bounds on the Coarseness of the n-Cube
- On Homeomorphic Embeddings of Km,n in the Cube
- Die dicke des n-dimensionalen Würfel-graphen
- On the Stable Crossing Number of Cubes
- Acquaintance Graph Party Problem
Cited In (only showing first 100 items - show all)
- Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges
- The maximum length of circuit codes with long bit runs and a new characterization theorem
- Drawing a graph in a hypercube
- Paired many-to-many disjoint path covers of hypercubes with faulty edges
- Note on the subgraph component polynomial
- Representation of finite graphs as difference graphs of \(S\)-units. I
- On Middle Cube Graphs
- One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
- Random walks on binary strings applied to the somatic hypermutation of B-cells
- Average consensus on networks with quantized communication
- Many-to-many disjoint paths in faulty hypercubes
- Packing the hypercube
- Dimensionality of hypercube clusters
- Structure connectivity and substructure connectivity of hypercubes
- How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube?
- Dense sets and embedding binary trees into hypercubes
- Fault-tolerant analysis of a class of networks
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks
- Survey on path and cycle embedding in some networks
- Antipodal graphs and oriented matroids
- Bipanconnectivity of faulty hypercubes with minimum degree
- Boolean layer cakes
- Sequential Monte Carlo for counting vertex covers in general graphs
- Cover-preserving order embeddings into Boolean lattices
- A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
- On path bipancyclicity of hypercubes
- Hamiltonian paths and cycles passing through a prescribed path in hypercubes
- Data center interconnection networks are not hyperbolic
- Paired many-to-many disjoint path covers of hypertori
- Rainbow connections of graphs
- Hamiltonian paths with prescribed edges in hypercubes
- Cycles passing through prescribed edges in a hypercube with some faulty edges
- Kolmogorov entropy for classes of convex functions
- Counting spanning trees in cobordism of two circulant graphs
- Counting Hamiltonian cycles in bipartite graphs
- Hypercubes, shuffle-exchange graphs and de Bruijn digraphs
- Reverse binary graphs
- Variations on a hypercube: Embellishments of parallel architectures
- Integral graphs and \((k,\tau )\)-regular sets
- Edge fault tolerance analysis of a class of interconnection networks
- Paired many-to-many disjoint path covers of the hypercubes
- On crossing numbers of hypercubes and cube connected cycles
- A scheme to construct distance-three codes using Latin squares, with applications to the \(n\)-cube
- Topes of oriented matroids and related structures
- Logical and geometrical distance in polyhedral Aristotelian diagrams in knowledge representation
- Counting rooted spanning forests in cobordism of two circulant graphs
- An atlas of robust, stable, high-dimensional limit cycles
- Planar median graphs and cubesquare-graphs
- Control of cancellations that restrain the growth of a binomial recursion
- Visualizing Boolean operations on a hypercube
- Extension of de Bruijn graph and Kautz graph
- Invariants of E-graphs
- Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
- Analysis of discrete bioregulatory networks using symbolic steady states
- Structure fault tolerance of hypercubes and folded hypercubes
- Some results on topological properties of folded hypercubes
- A characterization of cube-hypergraphs
- Many-to-many disjoint paths in hypercubes with faulty vertices
- Cubical graphs and cubical dimensions
- On graphs like hypercubes
- On \(k\)-ary \(n\)-cubes and isometric words
- Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
- Nonlinear piecewise polynomial approximation and multivariate \(BV\) spaces of a Wiener-L. Young type. I.
- On the skewness of Cartesian products with trees
- Quantum routing in planar graph using perfect state transfer
- Decomposition of hypercube graphs into paths and cycles of length four
- Bipartite Kneser graphs are Hamiltonian
- A new measure for locally \(t\)-diagnosable under PMC model
- Graphical designs and extremal combinatorics
- Structure connectivity and substructure connectivity of twisted hypercubes
- On meshy trees
- Number of proper paths in edge-colored hypercubes
- Hypercubes and isometric words based on swap and mismatch distance
- Genus of the hypercube graph and real moment-angle complexes
- Proper distance in edge-colored hypercubes
- Title not available (Why is that?)
- Vertex extensions of 4-layer graphs and hypercubes
- A heuristic approach for constructing symmetric Gray codes
- About uniqueness of the minimal 1-edge extension of hypercube Q4
- On the surface areas and average distances of meshes and tori
- Reliability analyses of regular graphs based on edge-structure connectivity
- Super fault-tolerance assessment of locally twisted cubes based on the structure connectivity
- Avoiding and extending partial edge colorings of hypercubes
- Extended formulations for perfect domination problems and their algorithmic implications
- Express the number of spanning trees in term of degrees
- Cayley properties of the line graphs induced by consecutive layers of the hypercube
- Properties of \(\pi\)-skew graphs with applications
- Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension
- Cluster connectivity of hypercube-based networks under the super fault-tolerance condition
- Rigidity properties of the hypercube via Bakry-Émery curvature
- Efficient quantum circuits for continuous-time quantum walks on composite graphs
- On some similarity of finite sets (and what we can say today about certain old problem)
- Cluster sampling for Morris method made easy
- An analysis of root functions -- a subclass of the impossible class of faulty functions (ICFF)
- Connectivity and diagnosability of the complete Josephus cube networks under \(h\)-extra fault-tolerant model
- A bandwagon bias based model for opinion dynamics: Intertwining between homophily and influence mechanisms
- Title not available (Why is that?)
- Bipartite Kneser graphs are Hamiltonian
- Structural Properties of Generalized Exchanged Hypercubes
- Reliability evaluation for bijection-connected networks based on the super \(P_k\)-connectivity
This page was built for publication: A survey of the theory of hypercube graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102985)
