Independent domination in hypercubes

DOI10.1016/0893-9659(93)90027-KzbMATH Open0780.05031OpenAlexW2051902439MaRDI QIDQ2367974FDOQ2367974

Authors: 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

Recommendations

• On independent and \((d, n)\)-domination numbers of hypercubes
• scientific article; zbMATH DE number 2234856
• A survey of the theory of hypercube graphs
• On paths and cycles dominating hypercubes
• scientific article; zbMATH DE number 617558

zbMATH Keywords

dominating setsindependent dominationhypercube graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Parallel concepts in graph theory
• Intersection Inequalities for the Covering Problem
• Title not available (Why is that?)
• What is the difference between the domination and independent domination numbers of a cubic graph?
• Improved sphere bounds on the covering radius of codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Covering problems for dichotomized matchings

Cited In (20)

• Leafy spanning trees in hypercubes
• EXISTENCE OF LATIN SQUARE DESIGNS ARISING FROM CLASSICAL GRAPH PARAMETERS B. CHALUVARAJU AND SHAIKH AMEER BASHA
• On independent and \((d, n)\)-domination numbers of hypercubes
• Algorithms to determine an independent dominating set of \(\mathrm{ESC}(n,k)\)
• On mixed codes with covering radius 1 and minimum distance 2
• A note of independent number and domination number of \(Q_{n, k, m}\)-graph
• On domination-type invariants of Fibonacci cubes and hypercubes
• Packings in bipartite prisms and hypercubes
• An analysis of root functions -- a subclass of the impossible class of faulty functions (ICFF)
• The domination number of exchanged hypercubes
• Independent transversal domination in trees, products and under local changes to a graph
• Iterative construction of the minimum independent dominating sets in hypercube graphs
• Independent domination in hereditary classes
• Random and conditional \((t,k)\)-diagnosis of hypercubes
• Product throttling
• Using maximality and minimality conditions to construct inequality chains
• Title not available (Why is that?)
• (Total) domination in prisms
• Title not available (Why is that?)
• The domination number of \(K_n^3\)

This page was built for publication: Independent domination in hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367974)