Vague graphs and strengths

Abstract

Vague graph represents the systems with uncertainty perfectly. In this paper, we introduced the strengths of paths in vague graphs. Different types of strong edges are discussed with examples. A new concept of strong edges, namely, independent strong edges is defined. The condition of vertex member ship values of a complete vague graph such that all the edges are independent strong edge, is established. After that, strong vertex, vertex connectivity, edge connectivity of vague graphs are introduced. The relation between edge connectivity and independent strong edge is established. Besides, several properties of the stated graphs have been proved.

Cite this work

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

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

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