Isometric embeddings in Hamming graphs (Q1110526): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0095-8956(90)90073-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980124329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypermetric Spaces and the Hamming Cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with intrinsic s3 convexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-preserving subgraphs of hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gated sets in metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cubical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Isometric Embeddings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Addressing Problem for Loop Switching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4052150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3333644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3890733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3734453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The retracts of Hamming graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isometric embedding in products of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On connectivity of triangulations of manifolds / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:29, 18 June 2024

scientific article
Language Label Description Also known as
English
Isometric embeddings in Hamming graphs
scientific article

    Statements

    Isometric embeddings in Hamming graphs (English)
    0 references
    0 references
    1990
    0 references
    An \(O(n^ 3)\)-algorithm is established which embeds a given graph isometrically into a Hamming graph (i.e., a Cartesian product of complete graphs) whenever possible, and recognizes non-embeddable graphs. From the algorithm several characterizations of the embeddable graphs are derived.
    0 references
    0 references
    embedding
    0 references
    gated subgraph
    0 references
    hypercube
    0 references
    isometric subgraph
    0 references
    algorithm
    0 references
    Hamming graph
    0 references
    Cartesian product
    0 references
    0 references