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.
A characterization of hypergraphs which are products of a finite number of edges / G., Burosh; Buratti, Marco; P. V., Ceccherini. - In: RENDICONTI DI MATEMATICA E DELLE SUE APPLICAZIONI. - ISSN 1120-7183. - 7:(1997), pp. 373-385.
A characterization of hypergraphs which are products of a finite number of edges
BURATTI, Marco;
1997
Abstract
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.File allegati a questo prodotto
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
