z-logo
open-access-imgOpen Access
Steiner μ Distance in Fuzzy Graphs with Application
Author(s) -
G.Priscilla Pacifica,
J.Jenit Ajitha
Publication year - 2020
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.d9010.049420
Subject(s) - steiner tree problem , combinatorics , mathematics , vertex (graph theory) , convexity , steiner system , metric (unit) , discrete mathematics , graph , operations management , financial economics , economics
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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here