Vertex‐strength of fuzzy graphs
Authors:
Open Access
- 1 January 2006
- journal article
- research article
- Published by Wiley in International Journal of Mathematics and Mathematical Sciences
- Vol. 2006 (1)
Abstract
The fuzzy coloring of a fuzzy graph was defined by the authors in Eslahchi and Onagh (2004). In this paper we define the chromatic fuzzy sum and strength of fuzzy graph. Some properties of these concepts are studied. It is shown that there exists an upper (a lower) bound for the chromatic fuzzy sum of a fuzzy graph.Keywords
This publication has 4 references indexed in Scilit:
- Coloring fuzzy graphsOmega, 2005
- The drinking philosophers problemACM Transactions on Programming Languages and Systems, 1984
- Upper bounds for static resource allocation in a distributed systemJournal of Computer and System Sciences, 1981
- FUZZY GRAPHS††The support of the Office of Computing Activities, National Science Foundation, under Grant GJ-32258X, is gratefully acknowledged, as is the help of Shelly Rowe in preparing this paper.1975