پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 161 |
| تعداد شماره‌ها | 6,573 |
| تعداد مقالات | 71,037 |
| تعداد مشاهده مقاله | 125,517,403 |
| تعداد دریافت فایل اصل مقاله | 98,777,771 |
Just chromatic exellence in fuzzy graphs | ||
| Journal of Algorithms and Computation | ||
| مقاله 3، دوره 49، شماره 2، اسفند 2017، صفحه 23-32 اصل مقاله (297.32 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22059/jac.2017.7974 | ||
| نویسندگان | ||
| M. Dharmalingam* ؛ R. Udaya Suriya | ||
| Department of Mathematics, The Madura College, Madurai | ||
| چکیده | ||
| A fuzzy graph is a symmetric binary fuzzy relation on a fuzzy subset. The concept of fuzzy sets and fuzzy relations was introduced by L.A.Zadeh in 1965\cite{zl} and further studied\cite{ka}. It was Rosenfeld\cite{ra} who considered fuzzy relations on fuzzy sets and developed the theory of fuzzy graphs in 1975. The concepts of fuzzy trees, blocks, bridges and cut nodes in fuzzy graph has been studied\cite{mss}. Computing chromatic sum of an arbitrary graph introduced by Kubica [1989] is known as NP-complete problem. Graph coloring is the most studied problem of combinatorial optimization. As an advancement fuzzy coloring of a fuzzy graph was defined by authors Eslahchi and Onagh in 2004, and later developed by them as Fuzzy vertex coloring\cite{eo} in 2006.This fuzzy vertex coloring was extended to fuzzy total coloring in terms of family of fuzzy sets by Lavanya. S and Sattanathan. R\cite{sls}. In this paper we are introducing \textquotedblleft Just Chromatic excellence in fuzzy graphs\textquotedblright. | ||
| کلیدواژه‌ها | ||
| fuzzy chromatic excellent؛ fuzzy just excel- lent؛ fuzzy colorful vertex | ||
|
آمار تعداد مشاهده مقاله: 698 تعداد دریافت فایل اصل مقاله: 607 |
||
سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب