Connectivity in fuzzy graphs

Sunil Mathew, John N. Mordeson, Davender S. Malik

Research output: Chapter in Book/Report/Conference proceedingChapter

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 languageEnglish (US)
Title of host publicationStudies in Fuzziness and Soft Computing
PublisherSpringer Verlag
Pages85-125
Number of pages41
Volume363
DOIs
StatePublished - Jan 1 2018

Publication series

NameStudies in Fuzziness and Soft Computing
Volume363
ISSN (Print)1434-9922

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Connectivity in fuzzy graphs'. Together they form a unique fingerprint.

  • Cite this

    Mathew, S., Mordeson, J. N., & Malik, D. S. (2018). Connectivity in fuzzy graphs. In 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