Dominating sets for uniform subset graphs

DOI10.1080/03081087.2022.2158295OpenAlexW4313251102MaRDI QIDQ6198672

Ozra Naserian, Unnamed Author, Mojgan Emami

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

dominating setblock designuniform subset graph

Mathematics Subject Classification ID

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

Cites Work

• Independent dominating sets in regular graphs
• Fair domination in graphs
• Some new large sets of \(t\)-designs
• Diameters of uniform subset graphs
• Hamiltonian uniform subset graphs
• t-designs on hypergraphs
• Automorphism groups of graph covers and uniform subset graphs
• Codes from adjacency matrices of uniform subset graphs
• Ternary codes from some reflexive uniform subset graphs
• Binary codes from reflexive uniform subset graphs on 3-sets
• Johnson graphs are Hamilton-connected
• An upper bound for domination number of 5-regular graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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