Silver cubes

DOI10.1007/s00373-008-0799-3zbMath1220.05039OpenAlexW2911394913MaRDI QIDQ1014825

Ebadollah S. Mahmoodian, Mohammad Ghebleh, Maryam Verdian-Rizi, Luis A. Goddyn

Publication date: 29 April 2009

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-008-0799-3

zbMATH Keywords

graph colouringfinite projective geometrycoding theorydomination in graphssilver matrix

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Designs and configurations (05B99)

Related Items (1)

Silver block intersection graphs of Steiner 2-designs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Defining sets in vertex colorings of graphs and latin rectangles
• Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
• A coloring problem on the \(n\)-cube
• A channel assignment problem for optical networks modelled by Cayley graphs
• Bounds on mixed binary/ternary codes
• Optimal binary one-error-correcting codes of length 10 have 72 codewords
• Labelling Cayley Graphs on Abelian Groups

This page was built for publication: Silver cubes