Maximal Binary Cliques

DOI10.1016/J.ENDM.2006.06.031MaRDI QIDQ3439443zbMATH OpenOpenAlexFDO

Authors Małgorzata Kuchta, Jolanta Stasiak

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2006.06.031

zbMATH Keywords

Hamming distanceHamming weightmaximal binary 2-clique

Mathematics Subject Classification ID

Distance in graphs (05C12) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• The binomial \(k\)-clique
• On the large maximal \(\{ 0,1,2,\dots,t\}\)-cliques in Hamming graph \(H(n,q)\)
• More on maximal intersecting families of finite sets
• scientific article; zbMATH DE number 4132192
• On the maximal clique problem

Cites work

• Ternary constant weight codes

Cited in

(4)

• Enumeration aspects of maximal cliques and bicliques
• The clique distribution in powers of hypercubes
• On the large maximal \(\{ 0,1,2,\dots,t\}\)-cliques in Hamming graph \(H(n,q)\)
• A class of maximal permutation cliques

This page was built for publication: Maximal Binary Cliques

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