Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4651299 | Discrete Mathematics | 2006 | 7 Pages |
Abstract
Let α(G)α(G) and χ(G)χ(G) denote the independence number and chromatic number of a graph G , respectively. Let G×HG×H be the direct product graph of graphs G and H. We show that if G and H are circular graphs, Kneser graphs, or powers of cycles, then α(G×H)=max{α(G)|V(H)|,α(H)|V(G)|}α(G×H)=max{α(G)|V(H)|,α(H)|V(G)|} and χ(G×H)=min{χ(G),χ(H)}χ(G×H)=min{χ(G),χ(H)}.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Mario Valencia-Pabon, Juan Vera,