Seminar Paper

Paper Information

video

sound

Persian Version

View:

726

Download:

Cites:

Information Seminar Paper

Title

ON THE RAINBOW CONNECTION NUMBER OF CERTAIN GRAPHS

Pages

 Start Page | End Page

Abstract

 THE RAINBOW CONNECTION NUMBER RC(G) OF A CONNECTED GRAPH G IS THE MINIMUM NUMBER OF COLORS NEEDED TO COLOR ITS EDGES, SO THAT EVERY PAIR OF ITS VERTICES IS CONNECTED BY AT LEAST ONE PATH IN WHICH NO TWO EDGES ARE COLORED THE SAME. IN THIS PAPER, WE STUDY THE RAINBOW CONNECTION NUMBER OF SOME SPECIFIC GRAPHS. WE APPLY OUR RESULTS TO OBTAIN THE RAINBOW CONNECTION NUMBER OF SOME GRAPHS WHICH ARE IMPORTANT IN CHEMISTRY AND NANO SCIENCE.

Cites

  • No record.
  • References

  • No record.
  • Related Journal Papers

  • No record.
  • Related Seminar Papers

  • No record.
  • Related Plans

  • No record.
  • Recommended Workshops