The number of edges in a subgraph of a Hamming graph

Applied Mathematics Letters

Volumn 14, Issue 6, 2001, Pages 701-705

  Squier, R ^a   Torrence, B ^b   Vogt, A ^a  

^a GEORGETOWN UNIVERSITY   (United States)

^b RANDOLPH MACON COLLEGE   (United States)

Author keywords

Average size; Completely decomposable; Maximum size

Indexed keywords

EID: 0035427491     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0893-9659(01)80030-6     Document Type: Article

References (7)

1. Djokovič D.Ž. Distance-preserving subgraphs of hypercubes. J. Combin. Theory, Ser. B. 14:1973;263-267.
2. Garey M.R., Graham R.L. On cubical graphs. J. Combin. Theory, Ser. B. 18:1975;84-95.
3. Wilkeit E. Isometric embedding in Hamming graphs. J. Combin. Theory, Ser. B. 50:1990;179-197.
4. Wagner A., Corneil D.G. Embedding trees in a hypercube is NP-complete. SIAM J. Comput. 19:1990;570-590.
5. Chung F.R.K., Füredi Z., Graham R.L., Seymour P. On induced subgraphs of the cube. J. Combin. Theory, Ser. A. 49:1988;180-187.
6. Harary F. Graph Theory. 1969;Addison-Wesley, Reading, MA.
7. Graham R.L. On primitive graphs and optimal vertex assignments. Ann. N. Y. Acad. Sci. 175:1970;170-186.