scholarly journals Steiner μ Distance in Fuzzy Graphs with Application

2020 ◽  
Vol 9 (4) ◽  
pp. 2156-2162
Keyword(s):  
Transport Network ◽  
Fuzzy Graphs ◽  
Eccentric Vertex ◽  
Ams Classification

In this article we define Steiner and upper Steiner distances in connected fuzzy graphs by combining the notion of Steiner distance with distance and proved that both are metric. Also based on length, eccentricity, radius, diameter, diametric vertex, eccentric vertex, centre, convexity, self-centred graphs are introduced for both Steiner and upper Steiner distances . Some common characteristic properties are analysed and relation between Steiner and upper Steiner distances are discussed with an application. A model result is given for transport network.2010 AMS Classification: 05C72, 05C12

scholarly journals Connectivity Indices of Intuitionistic Fuzzy Graphs and Their Applications in Internet Routing and Transport Network Flow

2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Tulat Naeem ◽  
Abdu Gumaei ◽  
Muhammad Kamran Jamil ◽  
Ahmed Alsanad ◽  
Kifayat Ullah
Keyword(s):  
Network Flow ◽  
Real Life ◽  
Vital Role ◽  
Transport Network ◽  
Internet Routing ◽  
Intuitionistic Fuzzy ◽  
Fuzzy Graphs ◽  
Life Problems ◽  
Connectivity Indices ◽  
Intuitionistic Fuzzy Graphs

Connectivity index CI has a vital role in real-world problems especially in Internet routing and transport network flow. Intuitionistic fuzzy graphs IFGs allow to describe two aspects of information using membership and nonmembership degrees under uncertainties. Keeping in view the importance of CI s in real life problems and comprehension of IFGs , we aim to develop some CI s in the environment of IFGs . We introduce two types of CI s , namely, CI and average CI , in the frame of IFGs . In spite of that, certain kinds of nodes called IF connectivity enhancing node IFCEN , IF connectivity reducing node IFCRN , and IF neutral node are introduced for IFGs . We have introduced strongest strong cycles, θ -evaluation of vertices, cycle connectivity, and CI of strong cycle. Applications of the CI s in two different types of networks are done, Internet routing and transport network flow, followed by examples to show the applicability of the proposed work.

End-to-End Redundancy and Maintenance Condition Design for Nationwide Optical Transport Network

2018 ◽  
Vol E101.B (11) ◽  
pp. 2267-2276 ◽  
Author(s):  
Yoshihiko UEMATSU ◽  
Shohei KAMAMURA ◽  
Hiroshi YAMAMOTO ◽  
Aki FUKUDA ◽  
Rie HAYASHI
Keyword(s):  
Transport Network ◽  
Optical Transport Network ◽  
End To End ◽  
Optical Transport

Energy of spherical fuzzy graphs

2020 ◽  
pp. 321-332
Author(s):  
S. Yahya Mohamed ◽  
A. Mohamed Ali
Keyword(s):  
Adjacency Matrix ◽  
Upper Bounds ◽  
Fuzzy Graph ◽  
Lower And Upper Bounds ◽  
Fuzzy Graphs

In this paper, the notion of energy extended to spherical fuzzy graph. The adjacency matrix of a spherical fuzzy graph is defined and we compute the energy of a spherical fuzzy graph as the sum of absolute values of eigenvalues of the adjacency matrix of the spherical fuzzy graph. Also, the lower and upper bounds for the energy of spherical fuzzy graphs are obtained.

INVERSE CLIQUE REGULAR DOMINATION NUMBER IN FUZZY GRAPHS

2020 ◽  
Vol 9 (5) ◽  
pp. 2895-2902
Author(s):  
S. Basheer Ahamed ◽  
M. Mohamed Riyazdeen ◽  
M. Magudeskumar
Keyword(s):  
Domination Number ◽  
Fuzzy Graphs
Sign in / Sign up

Export Citation Format

Share Document