Order structure of good sets in hypercube

DOI10.61091/JCMCC117-05zbMATH Open1544.0508WikidataQ129417903 ScholiaQ129417903MaRDI QIDQ6580121

B. N. Waphare, Sandhya A. Tapadia, N. V. Shinde

Publication date: 29 July 2024

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

cover graphs of lattices

Mathematics Subject Classification ID

Structure theory of lattices (06B05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on the edges of the n-cube
• An effective routing algorithm in incomplete hypercubes
• Parallel routing algorithms for incomplete hypercube interconnection networks
• The complexity of cover graph recognition for some varieties of finite lattices
• r-Identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube
• Isometric subgraphs of Hamming graphs and d-convexity

This page was built for publication: Order structure of good sets in hypercube

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