Paper Information

Journal:   IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI)   2014 , Volume 9 , Number 2; Page(s) 45 To 64.
 
Paper: 

CHROMATICITY OF TURAN GRAPHS WITH AT MOST THREE EDGES DELETED

 
 
Author(s):  LAU GEE CHOON, PENG YEE HOCK, ALIKHANI SAEID*
 
* DEPARTMENT OF MATHEMATICS, YAZD UNIVERSITY, 89195-741, YAZD, IRAN
 
Abstract: 

Let P (G, l) be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any graph H, P (H, l) = P(G, l) implies H is isomorphic to G. In this paper, we determine the chromaticity of all Turan graphs with at most three edges deleted. As a by product, we found many families of chromatically unique graphs and chromatic equivalence classes of graphs.

 
Keyword(s): CHROMATIC POLYNOMIAL, CHROMATIC UNIQUENESS, TURAN GRAPH
 
References: 
 
  pdf-File tarjomyar Yearly Visit 94
 
Latest on Blog
Enter SID Blog