Dominating sets for uniform subset graphs

DOI10.1080/03081087.2022.2158295MaRDI QIDQ6198672zbMATH OpenOpenAlexFDO

Authors M. Emami, O. Naserian

Publication date 23 February 2024

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03081087.2022.2158295

zbMATH Keywords

block designdominating setuniform subset graph

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Transversals and domination in uniform hypergraphs
• On the domination number of a graph defined by containment
• scientific article; zbMATH DE number 638692
• The domination number of the graph defined by two levels of the \(n\)-cube
• Hamiltonian uniform subset graphs

Cites work

• An upper bound for domination number of 5-regular graphs
• Automorphism groups of graph covers and uniform subset graphs
• Binary codes from reflexive uniform subset graphs on 3-sets
• Codes from adjacency matrices of uniform subset graphs
• Diameters of uniform subset graphs
• Fair domination in graphs
• Hamiltonian uniform subset graphs
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 4204392 (Why is no real title available?)
• scientific article; zbMATH DE number 638692 (Why is no real title available?)
• scientific article; zbMATH DE number 1016456 (Why is no real title available?)
• Independent dominating sets in regular graphs
• Johnson graphs are Hamilton-connected
• Some new large sets of \(t\)-designs
• t-designs on hypergraphs
• Ternary codes from some reflexive uniform subset graphs

Cited in

(1)

• An algebraic approach to sets defining minimal dominating sets of regular graphs

This page was built for publication: Dominating sets for uniform subset graphs

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