Independent Sets in Direct Products of Vertex-transitive Graphs
Combinatorics
2010-07-07 v1
Abstract
The direct product of graphs and is defined by: and In this paper, we will prove that the equality holds for all vertex-transitive graphs and , which provides an affirmative answer to a problem posed by Tardif (Discrete Math. 185 (1998) 193-200). Furthermore, the structure of all maximum independent sets of are determined.
Keywords
Cite
@article{arxiv.1007.0797,
title = {Independent Sets in Direct Products of Vertex-transitive Graphs},
author = {Huajun Zhang},
journal= {arXiv preprint arXiv:1007.0797},
year = {2010}
}
Comments
11 pages