Characterizing subgraphs of Hamming graphs

Cartesian products of complete graphs are known as Hamming graphs. Using embeddings into Cartesian products of quotient graphs we characterize subgraphs, induced subgraphs, and isometric subgraphs of Hamming graphs. For instance, a graph G is an induced subgraph of a Hamming graph if and only if there exists a labeling of E(G) fulfilling the following two conditions: (i) incident edges receive the same label if and only if they lie on a common triangle; (ii) for any vertices u and v at distance at least two, there exist two labels which both appear on any induced u, v-path.

[1]  Sandi Klavzar,et al.  On subgraphs of Cartesian product graphs , 2002, Discret. Math..

[2]  R. Graham,et al.  Isometric embeddings of graphs. , 1984, Proceedings of the National Academy of Sciences of the United States of America.

[3]  Bostjan Bresar.  On subgraphs of Cartesian product graphs and S-primeness , 2004, Discret. Math..

[4]  Bostjan Bresar.  On subgraphs of Cartesian product graphs and S-primeness , 2000, Electron. Notes Discret. Math..

[5]  D. Djoković.  Distance-preserving subgraphs of hypercubes , 1973 .

[6]  Henry Martyn Mulder.  Interval-regular graphs , 1982, Discret. Math..

[7]  H. M. Mulder.  The interval function of a graph , 1980 .

[8]  Yoshimi Egawa.  Characterization of the cartesian product of complete graphs by convex subgraphs , 1986, Discret. Math..

[9]  R. H. Lamprey,et al.  A new concept of primeness in graphs , 1981, Networks.

[10]  Wilfried Imrich,et al.  Embedding Graphs into Cartesian Products , 1989 .

[11]  Michel Mollard,et al.  Two characterizations of generalized hypercube , 1991, Discret. Math..

[12]  Elke Wilkeit,et al.  Isometric embeddings in Hamming graphs , 1990, J. Comb. Theory, Ser. B.

[13]  Richard K. Squier,et al.  The number of edges in a subgraph of a Hamming graph , 2001, Appl. Math. Lett..

[14]  W. Ilfried,et al.  On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs , 1996 .

[15]  Donald E. Knuth,et al.  Stable Networks and Product Graphs , 1995 .

[16]  Hans-Jürgen Bandelt,et al.  Quasi-median graphs and algebras , 1994, J. Graph Theory.

[17]  Tomás Feder.  Product graph representations , 1992, J. Graph Theory.

[18]  Franz Aurenhammer,et al.  Faster Isometric Embedding in Products of Complete Graphs , 1994, Discret. Appl. Math..

[19]  W. Imrich,et al.  Product Graphs: Structure and Recognition , 2000 .

[20]  Bostjan Bresar.  Partial Hamming graphs and expansion procedures , 2001, Discret. Math..

[21]  Wilfried Imrich,et al.  Recognizing Hamming Graphs in Linear Time and space , 1997, Inf. Process. Lett..

[22]  Peter Winkler,et al.  Isometric embedding in products of complete graphs , 1984, Discret. Appl. Math..

[23]  Michel Deza,et al.  Geometry of cuts and metrics , 2009, Algorithms and combinatorics.