Skip to main content Accessibility help
×
Home

WEAKLY PERFECT GRAPHS ARISING FROM RINGS

  • H. R. MAIMANI (a1), M. R. POURNAKI (a2) and S. YASSEMI (a3)

Abstract

A graph is called weakly perfect if its chromatic number equals its clique number. In this paper a new class of weakly perfect graphs arising from rings are presented and an explicit formula for the chromatic number of such graphs is given.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      WEAKLY PERFECT GRAPHS ARISING FROM RINGS
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      WEAKLY PERFECT GRAPHS ARISING FROM RINGS
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      WEAKLY PERFECT GRAPHS ARISING FROM RINGS
      Available formats
      ×

Copyright

References

Hide All
1.Ashrafi, N., Maimani, H. R., Pournaki, M. R. and Yassemi, S., Unit graphs associated with rings, Comm. Algebra, to appear.
2.Atiyah, M. F. and Macdonald, I. G., Introduction to Commutative Algebra (Addison Wesley, Reading, MA.–London–Don Mills, ON, 1969).
3.Grimaldi, R. P., Graphs from rings, in Proceedings of the Twentieth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1989). Congr. Numer. 71 (1990), 95103.
4.McDonald, B. R., Finite rings with identity, in Pure and Applied Mathematics, vol. 28 (Marcel Dekker, Inc., New York, 1974).
5.West, D. B., Introduction to Graph Theory (Prentice Hall, Upper Saddle River, NJ, 1996).

Keywords

WEAKLY PERFECT GRAPHS ARISING FROM RINGS

  • H. R. MAIMANI (a1), M. R. POURNAKI (a2) and S. YASSEMI (a3)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.