The number of edges in a subgraph of a Hamming graph (Q1600356): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q126310837, #quickstatements; #temporary_batch_1722371031483
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Bruce Torrence / rank
Normal rank
 
Property / author
 
Property / author: Bruce Torrence / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-preserving subgraphs of hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cubical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isometric embeddings in Hamming graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Trees in a Hypercube is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On induced subgraphs of the cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126310837 / rank
 
Normal rank

Latest revision as of 22:29, 30 July 2024

scientific article
Language Label Description Also known as
English
The number of edges in a subgraph of a Hamming graph
scientific article

    Statements

    The number of edges in a subgraph of a Hamming graph (English)
    0 references
    0 references
    0 references
    0 references
    13 June 2002
    0 references
    size
    0 references
    decomposable
    0 references
    subgraph
    0 references
    Cartesian product
    0 references
    Hamming graph
    0 references

    Identifiers