More on blocks in fuzzy graphs

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

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Scopus citations

Abstract

As defined in Chap. 2, a fuzzy graph without fuzzy cutvertices is called a block (nonseparable). Rosenfeld introduced this concept in 1975. In contrast to the classical concept of blocks in graphs, the study of blocks in fuzzy graphs is challenging due to the complexity of cutvertices. Note that cutvertices of a fuzzy graph are those vertices which reduce the strength of connectedness between some pair of vertices on its removal from the fuzzy graph rather than the total disconnection of the fuzzy graph. In this chapter, we concentrate on blocks of fuzzy graphs. This work is from Anjali and Mathew, J Fuzzy Math, 23(4), 907–916 (2015), [28], Anjali and Mathew, J Intell Fuzzy Syst 28, 1659–1665 (2015), [29], Anjali and Mathew, Transitive blocks in fuzzy graphs (2017), [30].

Original languageEnglish (US)
Title of host publicationStudies in Fuzziness and Soft Computing
PublisherSpringer Verlag
Pages127-153
Number of pages27
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 'More on blocks in fuzzy graphs'. Together they form a unique fingerprint.

  • Cite this

    Mathew, S., Mordeson, J. N., & Malik, D. S. (2018). More on blocks in fuzzy graphs. In Studies in Fuzziness and Soft Computing (Vol. 363, pp. 127-153). (Studies in Fuzziness and Soft Computing; Vol. 363). Springer Verlag. https://doi.org/10.1007/978-3-319-71407-3_4