Hypercubes as direct products

SIAM Journal on Discrete Mathematics

Volumn 18, Issue 4, 2005, Pages 778-786

  Brešar, Boštjan ^a   Imrich, Wilfried ^b   Klavžar, Sandi ^a   Zmazek, Blaž ^a  

^a UNIVERSITY OF MARIBOR   (Slovenia)

^b UNIVERSITY OF LEOBEN   (Austria)

Author keywords

Automorphism; Direct product; Hypercube; Involution

Indexed keywords

MATHEMATICAL MODELS; MATHEMATICAL OPERATORS;

AUTOMORPHISM; DIRECT PRODUCT; HYPERCUBE; INVOLUTION;

GRAPH THEORY;

EID: 27844550727     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480103438358     Document Type: Article

References (23)

1. M. H. ALBERT, D. HOLTON, AND R. J. NOWAKOWSKI, The ultimate categorical matching in a graph, Discrete Math., 232 (2001), pp. 1-9.
2. B. BREŠAR, P. K. JHA, S. KLAVŽAR, AND B. ZMAZEK, Median direct products of graphs, Discuss. Math. Graph Theory, 25 (2005), in press.
3. J. I. BROWN, R. J. NOWAKOWSKI, AND D. RALL, The ultimate categorical independence ratio of a graph, SIAM J. Discrete Math., 9 (1996), pp. 290-300.
4. J. FEIGENBAUM AND A. A. SCHÄFFER, Finding the prime factors of strong direct product graphs in polynomial time, Discrete Math., 109 (1992), pp. 77-102.
5. R. L. GRAHAM, On primitive graphs and optimal vertex assignments, Ann. New York Acad. Sci., 175 (1970), pp. 170-186.
6. D. GREENWELL AND L. LOVÁSZ, Applications of product colouring, Acta Math. Acad. Sci. Hungar., 25 (1974), pp. 335-340.
7. P. HELL, An introduction to the category of graphs, in Topics in Graph Theory (New York, 1977), Ann. New York Acad. Sci. 328, New York Acad. Sci., New York, 1979, pp. 120-136.
8. M.-C. HEYDEMANN, J. G. PETERS, AND D. SOTTEAU, Spanners of hypercube-derived networks, SIAM J. Discrete Math., 9 (1996), pp. 37-54.
9. L.-H. HSU, A note on the ultimate categorical matching in a graph, Discrete Math., 256 (2002), pp. 487-488.
10. W. IMRICH, Factoring cardinal product graphs in polynomial time, Discrete Math., 192 (1998), pp. 119-144.
11. W. IMRICH AND S. KLAVŽAR, Product Graphs, Wiley-Interscience, New York, 2000.
12. W. IMRICH, S. KLAVŽAR, AND H. M. MULDER, Median graphs and triangle-free graphs, SIAM J. Discrete Math., 12 (1999), pp. 111-118.
13. B. LAROSE AND C. TARDIF, Projectivity and independent sets in powers of graphs, J. Graph Theory, 40 (2002), pp. 162-171.
14. R. MCKENZIE, Cardinal multiplication of structures with a reflexive relation, Fund. Math., 70 (1971), pp. 59-101.
15. J. NEŠETŘIL, Representations of graphs by means of products and their complexity, in Mathematical Foundations of Computer Science, 1981 (Štrbské Pleso, 1981), Lecture Notes in Comput. Sci. 118, Springer, Berlin, New York, 1981, pp. 94-102.
16. M. RAMRAS, Congestion-free routings of linear complement permutations, SIAM J. Discrete Math., 11 (1998), pp. 487-500.
17. N. SAUER, Hedetniemi's conjecture - A survey, Discrete Math., 229 (2001), pp. 261-292.
18. R. SQUIER, B. TORRENCE, AND A. VOGT, The number of edges in a subgraph of a Hamming graph, Appl. Math. Lett., 14 (2001), pp. 701-705.
19. P. M. WEICHSEL, The Kronecker product of graphs, Proc. Amer. Math. Soc., 13 (1962), pp. 47-52.
20. B. YU, J. CHERIYAN, AND P. E. HAXELL, Hypercubes and multicommodity flows, SIAM J. Discrete Math., 10 (1997), pp. 190-200.
21. X. ZHU, A survey on Hedetniemi's conjecture, Taiwanese J. Math., 2 (1998), pp. 1-24.
22. X. ZHU, Construction of uniquely H-colorable graphs, J. Graph Theory, 30 (1999), pp. 1-6.
23. X. ZHU, The fractional chromatic number of the direct product of graphs, Glasg. Math. J., 44 (2002), pp. 103-115.