video

sound

Persian Version

View:

37,550

Download:

16,142

Cites:

Information Journal Paper

Title

CHROMATICITY OF TURAN GRAPHS WITH AT MOST THREE EDGES DELETED

Pages

  45-64

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.

Cites

  • No record.
  • References

    Related Journal Papers

  • No record.
  • Related Seminar Papers

  • No record.
  • Related Plans

  • No record.
  • Recommended Workshops

    Cite