The domination number of exchanged hypercubes
From MaRDI portal
Publication:2445897
DOI10.1016/J.IPL.2013.12.005zbMath1294.05123OpenAlexW2143787152MaRDI QIDQ2445897
Publication date: 15 April 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2013.12.005
Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (8)
Locally exchanged twisted cubes: connectivity and super connectivity ⋮ A Note of Independent Number and Domination Number of Qn,k,m-Graph ⋮ Subgraph-based Strong Menger Connectivity of Hypercube and Exchanged Hypercube ⋮ Reliability and hybrid diagnosis of exchanged hypercube ⋮ Routing and wavelength assignment for exchanged hypercubes in linear array optical networks ⋮ A comment on ``The domination number of exchanged hypercubes ⋮ Structural Properties of Generalized Exchanged Hypercubes ⋮ The domination complexity and related extremal values of large 3D torus
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conditional edge-fault-tolerant Hamiltonicity of dual-cubes
- On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes
- Efficient collective communications in dual-cube
- Cycles embedding in exchanged hypercubes
- Domination numbers of undirected toroidal mesh
- Hamiltonian cycles in hypercubes with \(2n-4\) faulty edges
- On paths and cycles dominating hypercubes
- On independent and \((d, n)\)-domination numbers of hypercubes
- Linearly many faults in dual-cube-like networks
- The super connectivity of exchanged hypercubes
- Independent domination in hypercubes
- Generalized measures of fault tolerance in exchanged hypercubes
- On the mutually independent Hamiltonian cycles in faulty hypercubes
- Domination in Graphs
- THE CONNECTIVITY OF EXCHANGED HYPERCUBES
This page was built for publication: The domination number of exchanged hypercubes
