Independent domination in hypercubes
From MaRDI portal
Publication:2367974
DOI10.1016/0893-9659(93)90027-KzbMath0780.05031OpenAlexW2051902439MaRDI QIDQ2367974
Frank Harary, Marilynn L. Livingston
Publication date: 19 August 1993
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0893-9659(93)90027-k
Extremal problems in graph theory (05C35) Applications of graph theory to circuits and networks (94C15)
Related Items (15)
Using maximality and minimality conditions to construct inequality chains ⋮ Independent transversal domination in trees, products and under local changes to a graph ⋮ A Note of Independent Number and Domination Number of Qn,k,m-Graph ⋮ On domination-type invariants of Fibonacci cubes and hypercubes ⋮ Random and conditional \((t,k)\)-diagnosis of hypercubes ⋮ Iterative construction of the minimum independent dominating sets in hypercube graphs ⋮ EXISTENCE OF LATIN SQUARE DESIGNS ARISING FROM CLASSICAL GRAPH PARAMETERS B. CHALUVARAJU AND SHAIKH AMEER BASHA ⋮ Packings in bipartite prisms and hypercubes ⋮ The domination number of exchanged hypercubes ⋮ (Total) domination in prisms ⋮ On mixed codes with covering radius 1 and minimum distance 2 ⋮ Leafy spanning trees in hypercubes ⋮ An analysis of root functions -- a subclass of the impossible class of faulty functions (ICFF) ⋮ The domination number of \(K_n^3\) ⋮ Product throttling
Cites Work
- What is the difference between the domination and independent domination numbers of a cubic graph?
- Parallel concepts in graph theory
- Improved sphere bounds on the covering radius of codes
- Intersection Inequalities for the Covering Problem
- Covering problems for dichotomized matchings
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Independent domination in hypercubes
