Affiliations: [a]
Department of Mathematics, Joykrishnapur High School (H.S.), Tamluk, India
| [b]
Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore, India
| [c] Young Researchers and Elite club, Central Tehran Branch, Islamic Azad University, Tehran, Iran
| [d]
Department of Mathematics, Shahid Beheshti University, Tehran, Iran
Correspondence:
[*]
Corresponding author: Sovan Samanta, Department of Mathematics, Joykrishnapur High School (H.S.),
Tamluk-721649, India. E-mail: ssamantavu@gmail.com.
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 membership 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.
Keywords: Vague graphs, strong edges, connectivity in vague graphs
