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...
Saved in:
| Main Authors: | Changiz Eslahchi, B. N. Onagh |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2006-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/IJMMS/2006/43614 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On Total Vertex Irregularity Strength of Hexagonal Cluster Graphs
by: Nurdin Hinding, et al.
Published: (2021-01-01) -
On the Construction of the Reflexive Vertex k-Labeling of Any Graph with Pendant Vertex
by: I. H. Agustin, et al.
Published: (2020-01-01) -
Optimal Network Analysis through Vertex Order Coloring of Intuitionistic Fuzzy Graph Operations
by: A. Meenakshi, et al.
Published: (2024-01-01) -
ON THE TOTAL VERTEX IRREGULARITY STRENGTH OF SERIES PARALLEL GRAPH sp(m,r,4)
by: Corry Corazon Marzuki, et al.
Published: (2024-03-01) -
Vertex degrees in grid graphs of permutations
by: Aubrey Blecher, et al.
Published: (2025-07-01)