Abstract
Connectivity is one of the important concepts in network theory. Bandwidth problem in communication theory, widest path problem in transportation theory and bottleneck problem in computer networks are all modeled as different types of graphs and studied using graph connectivity parameters. This paper attempts to study a new connectivity parameter in fuzzy graphs, termed as connectivity remainder. It is related to the excess capacities at vertices of a fuzzy graph and hence is a helpful tool for the enhancement of flows through different paths. It is studied with regard to different fuzzy graph structures and isomorphisms. Vertices and edges influencing the connectivity remainder of a fuzzy graph are also determined. A related algorithm and a relevant application are provided towards the end.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
