{"id":"https://openalex.org/keywords/boolean-hypercube","display_name":"Boolean hypercube","description":"A graph whose vertices are binary strings of a fixed length, with edges joining strings that differ in exactly one coordinate.","display_name_alternatives":["Boolean cube graph","Boolean hypercube graph","n-cube graph"],"ids":{"openalex":"https://openalex.org/keywords/boolean-hypercube","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.227,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.227,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.1199,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":568,"cited_by_count":5617,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/boolean-hypercube","updated_date":"2026-11-15T04:06:23","created_date":"2026-09-30T00:00:00"}
