Loading...

Density and power graphs in graph homomorphism problem

Daneshgar, A. (Amir) ; Sharif University of Technology

475 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.disc.2007.07.090
  3. Abstract:
  4. We introduce two necessary conditions for the existence of graph homomorphisms based on the concepts of density and power graph. As corollaries, we obtain a lower bound for the fractional chromatic number, and we set forward elementary proofs of the facts that the circular chromatic number of the Petersen graph is equal to three and the fact that the Coxeter graph is a core
  5. Keywords:
  6. Graph homomorphism ; Power graph ; Density ; Pentagon conjecture
  7. Source: Discrete Mathematics ; Volume 308, Issue 17, 6 September 2008, Pages 4027–4030
  8. URL: http://www.sciencedirect.com/science/article/pii/S0012365X07005857