A characterization of hypergraphs which are products of a finite number of edges

A characterization of hypergraphs which are products of a finite number of edges

We prove that a hypergraph is a product of a finite number of edges if and only if it is interval-regular, satisfies the gated-edge property and has a vertex of finite degree. As a consequence, we get a characterization of Hamming graphs.

Bibliographic Details
Main Authors: Marco Buratti, Gustav Burosch, Pier Vittorio Ceccherini
Format: Article
Language:English
Published: Sapienza Università Editrice 1997-01-01
Series:Rendiconti di Matematica e delle Sue Applicazioni
Subjects:
hypergraphs
graphs
hamming graphs
hypercubes
geodesics
interval-regularity
characterization theorems
Online Access:https://www1.mat.uniroma1.it/ricerca/rendiconti/ARCHIVIO/1997(3)/373-385.pdf

Internet

https://www1.mat.uniroma1.it/ricerca/rendiconti/ARCHIVIO/1997(3)/373-385.pdf

Similar Items