### Abstract

In graph theory, edge analysis is not very necessary because all edges have the same weight one. But in fuzzy graphs, the strength of an edge is a real number in [0, 1] and hence the properties of edges and paths may vary significantly from that of graphs. So it is important to identify and study the nature of edges of fuzzy graphs. In Chap. 2, we have discussed the strength of connectedness between two vertices x and y in a fuzzy graph G. In this chapter, a detailed analysis of the structure of fuzzy graphs based on the strength of connectedness will be made.

Original language | English (US) |
---|---|

Title of host publication | Studies in Fuzziness and Soft Computing |

Publisher | Springer Verlag |

Pages | 85-125 |

Number of pages | 41 |

Volume | 363 |

DOIs | |

State | Published - Jan 1 2018 |

### Publication series

Name | Studies in Fuzziness and Soft Computing |
---|---|

Volume | 363 |

ISSN (Print) | 1434-9922 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Computer Science (miscellaneous)
- Computational Mathematics

### Cite this

*Studies in Fuzziness and Soft Computing*(Vol. 363, pp. 85-125). (Studies in Fuzziness and Soft Computing; Vol. 363). Springer Verlag. https://doi.org/10.1007/978-3-319-71407-3_3

**Connectivity in fuzzy graphs.** / Mathew, Sunil; Mordeson, John N.; Malik, Davender S.

Research output: Chapter in Book/Report/Conference proceeding › Chapter

*Studies in Fuzziness and Soft Computing.*vol. 363, Studies in Fuzziness and Soft Computing, vol. 363, Springer Verlag, pp. 85-125. https://doi.org/10.1007/978-3-319-71407-3_3

}

TY - CHAP

T1 - Connectivity in fuzzy graphs

AU - Mathew, Sunil

AU - Mordeson, John N.

AU - Malik, Davender S.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - In graph theory, edge analysis is not very necessary because all edges have the same weight one. But in fuzzy graphs, the strength of an edge is a real number in [0, 1] and hence the properties of edges and paths may vary significantly from that of graphs. So it is important to identify and study the nature of edges of fuzzy graphs. In Chap. 2, we have discussed the strength of connectedness between two vertices x and y in a fuzzy graph G. In this chapter, a detailed analysis of the structure of fuzzy graphs based on the strength of connectedness will be made.

AB - In graph theory, edge analysis is not very necessary because all edges have the same weight one. But in fuzzy graphs, the strength of an edge is a real number in [0, 1] and hence the properties of edges and paths may vary significantly from that of graphs. So it is important to identify and study the nature of edges of fuzzy graphs. In Chap. 2, we have discussed the strength of connectedness between two vertices x and y in a fuzzy graph G. In this chapter, a detailed analysis of the structure of fuzzy graphs based on the strength of connectedness will be made.

UR - http://www.scopus.com/inward/record.url?scp=85040006228&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85040006228&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-71407-3_3

DO - 10.1007/978-3-319-71407-3_3

M3 - Chapter

AN - SCOPUS:85040006228

VL - 363

T3 - Studies in Fuzziness and Soft Computing

SP - 85

EP - 125

BT - Studies in Fuzziness and Soft Computing

PB - Springer Verlag

ER -