Opening book details…
Can I read Characterizing subgraphs of Hamming graphs on EtoBox?
Characterizing subgraphs of Hamming graphs by Sandi Klavžar; Iztok Peterin is a Computer Science article available to read on EtoBox.
What is Characterizing subgraphs of Hamming graphs about?
## Abstract 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) edges of a triangle receive the same label; (ii) for any vertices __u__ and __v__ at distance at least two, there exist two labels which both appear on any induced __u__, υ‐path. © 2005 Wiley Periodicals, Inc. J Graph Theory 49: 302–312, 2005
Who reads Characterizing subgraphs of Hamming graphs?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Sandi Klavžar; Iztok Peterin
- Publisher
- John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Inc.; Wiley (ISSN 0364-9024)
- Published
- 2005
- Language
- EN
- Field
- Computer Science (Physical Sciences)