التفاصيل البيبلوغرافية
العنوان: |
Application of soft sets to graph coloring. |
المؤلفون: |
Hamidizadeh, K., Manaviyat, R., Mirvakili, S., Davvaz, B. |
المصدر: |
Computational & Applied Mathematics; Jun2024, Vol. 43 Issue 4, p1-11, 11p |
مصطلحات موضوعية: |
SOFT sets, GRAPH coloring, FUZZY sets, HYPERGRAPHS |
مستخلص: |
Zadeh's fuzzy set maybe considered as a special case of the soft sets. Soft sets proposed by Molodtsov in 1999 to address uncertainty in a parametric manner. The concept of soft graph was introduced by combining the concepts of graphs and soft sets. In this paper, the notion of graph coloring is extended to soft graphs and then the introduction and investigation of (total) soft coloring and (total) soft chromatic number of soft graphs, which are generalizations of (total) vertex coloring and (total) chromatic number of graphs, respectively, are presented. It is demonstrated that the soft coloring unifies the concepts of vertex coloring, edge coloring, and coloring of hypergraphs. Additionally, the determination of total soft chromatic numbers for certain classes of graphs is provided. In particular, we obtain the lower and upper bounds of set chromatic number of the soft graphs. [ABSTRACT FROM AUTHOR] |
|
Copyright of Computational & Applied Mathematics is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
قاعدة البيانات: |
Complementary Index |