Vertex-strength of fuzzy graphs
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...
Main Authors: | Changiz Eslahchi, B. N. Onagh |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2006-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Online Access: | http://dx.doi.org/10.1155/IJMMS/2006/43614 |
Similar Items
-
Computation of Total Vertex Irregularity Strength of Theta Graphs
by: Ali N. A. Koam, et al.
Published: (2019-01-01) -
On Total Vertex Irregularity Strength of Hexagonal Cluster Graphs
by: Nurdin Hinding, et al.
Published: (2021-01-01) -
On Total Vertex Irregularity Strength of Cocktail Party Graph
by: Kristiana Wijaya, et al.
Published: (2011-07-01) -
Vertex Ranking of Graphs
by: Nancy N.H. Teng, et al.
Published: (2007) -
Vertex Degrees and Isomorphic Properties in Complement of an m-Polar Fuzzy Graph
by: Ch. Ramprasad, et al.
Published: (2017-01-01)