Completeness and regularity of generalized fuzzy graphs

Sovan Samanta · Biswajit Sarkar · Dongmin Shin · Madhumangal Pal

60 citations0/0 files storedSpringerPlus

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Fuzzy and Soft Set Theory Advanced Algebra and Logic Fuzzy Systems and Optimization

Abstract

Fuzzy graphs are the backbone of many real systems like networks, image, scheduling, etc. But, due to some restriction on edges, fuzzy graphs are limited to represent for some systems. Generalized fuzzy graphs are appropriate to avoid such restrictions. In this study generalized fuzzy graphs are introduced. In this study, matrix representation of generalized fuzzy graphs is described. Completeness and regularity are two important parameters of graph theory. Here, regular and complete generalized fuzzy graphs are introduced. Some properties of them are discussed. After that, effective regular graphs are exemplified.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 60 citations exist upstream.

References

2000Fuzzy Graphs and Fuzzy Hypergraphs 2011Bipolar fuzzy graphs 1991Fuzzy sets and their applications 2003Strong arcs in fuzzy graphs 2009Types of arcs in a fuzzy graph 2006Intuitionistic Fuzzy Graphs 2010Interval-valued fuzzy graphs 2013Fuzzy k-Competition Graphs and p-Competition Fuzzy Graphs

Cited by

2017Covering and paired domination in intuitionistic fuzzy graphs 2020Applications of Edge Colouring of Fuzzy Graphs

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.