Fuzzy Detour Convexity and Fuzzy Detour Covering in Fuzzy Graphs

A path P connecting a pair of vertices in a connected fuzzy graph is called a fuzzy detour, if its μ - length is maximum among all the feasible paths between them. In this paper we establish the notion of fuzzy detour convex sets, fuzzy detour covering, fuzzy detour basis, fuzzy detour number, fuzzy...

Full description

Saved in:
Bibliographic Details
Published in:Turkish journal of computer and mathematics education 2021-04, Vol.12 (2), p.2170-2175
Main Authors: Rajeshkumar, R, Anto, A M
Format: Article
Language:English
Subjects:
Apexes
Convexity
Fuzzy sets
Graph theory
Set theory
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 2175
container_issue 2
container_start_page 2170
container_title Turkish journal of computer and mathematics education
container_volume 12
creator Rajeshkumar, R
Anto, A M
description A path P connecting a pair of vertices in a connected fuzzy graph is called a fuzzy detour, if its μ - length is maximum among all the feasible paths between them. In this paper we establish the notion of fuzzy detour convex sets, fuzzy detour covering, fuzzy detour basis, fuzzy detour number, fuzzy detour blocks and investigate some of their properties. It has been proved that, for a complete fuzzy graph G, the set of any pair of vertices in G is a fuzzy detour covering. A necessary and sufficient condition for a complete fuzzy graph to become a fuzzy detour block is also established. It has been proved that for a fuzzy tree there exists a nested chain of sets, where each set is a fuzzy detour convex. Application of fuzzy detour covering and fuzzy detour basis is also presented.  
doi_str_mv 10.17762/turcomat.v12i2.1898
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2624697164</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2624697164</sourcerecordid><originalsourceid>FETCH-LOGICAL-c143t-19944d8e2346b0f3e3960af046ef64bd6e8553ab2486026e6269f6490d18b8003</originalsourceid><addsrcrecordid>eNpdkE1Lw0AQhhdRsNT-Aw8Bz4mzH5ns3pRoq1Dwoudlk2w0xSZxNwmmv76xrSCeZuB5eWd4CLmmENEkQXbb9S5vtqaLBsoqFlGp5BmZUQ4qFBjz8z_7JVl4vwEAGidCSpyRu2W_243Bg-2a3gVpUw_2u-rGwNRF8A8N1lX1e1DVJ7Bypv3wV-SiNJ_eLk5zTt6Wj6_pU7h-WT2n9-swp4J3IVVKiEJaxgVmUHLLFYIpQaAtUWQFWhnH3GRMSASGFhmqCSgoqMwkAJ-Tm2Nv65qv3vpOb6a36umkZsgEqoSimFLimMpd472zpW5dtTVu1BT0QZf-1aUPuvSPLr4HBvZfdw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2624697164</pqid></control><display><type>article</type><title>Fuzzy Detour Convexity and Fuzzy Detour Covering in Fuzzy Graphs</title><source>Publicly Available Content Database</source><source>Social Science Premium Collection</source><source>Education Collection</source><creator>Rajeshkumar, R ; Anto, A M</creator><creatorcontrib>Rajeshkumar, R ; Anto, A M</creatorcontrib><description>A path P connecting a pair of vertices in a connected fuzzy graph is called a fuzzy detour, if its μ - length is maximum among all the feasible paths between them. In this paper we establish the notion of fuzzy detour convex sets, fuzzy detour covering, fuzzy detour basis, fuzzy detour number, fuzzy detour blocks and investigate some of their properties. It has been proved that, for a complete fuzzy graph G, the set of any pair of vertices in G is a fuzzy detour covering. A necessary and sufficient condition for a complete fuzzy graph to become a fuzzy detour block is also established. It has been proved that for a fuzzy tree there exists a nested chain of sets, where each set is a fuzzy detour convex. Application of fuzzy detour covering and fuzzy detour basis is also presented.  </description><identifier>ISSN: 1309-4653</identifier><identifier>EISSN: 1309-4653</identifier><identifier>DOI: 10.17762/turcomat.v12i2.1898</identifier><language>eng</language><publisher>Gurgaon: Ninety Nine Publication</publisher><subject>Apexes ; Convexity ; Fuzzy sets ; Graph theory ; Set theory</subject><ispartof>Turkish journal of computer and mathematics education, 2021-04, Vol.12 (2), p.2170-2175</ispartof><rights>2021. This work is published under https://creativecommons.org/licenses/by/4.0 (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2624697164?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,21378,21394,25753,27924,27925,33611,33877,37012,43733,43880,44590</link.rule.ids></links><search><creatorcontrib>Rajeshkumar, R</creatorcontrib><creatorcontrib>Anto, A M</creatorcontrib><title>Fuzzy Detour Convexity and Fuzzy Detour Covering in Fuzzy Graphs</title><title>Turkish journal of computer and mathematics education</title><description>A path P connecting a pair of vertices in a connected fuzzy graph is called a fuzzy detour, if its μ - length is maximum among all the feasible paths between them. In this paper we establish the notion of fuzzy detour convex sets, fuzzy detour covering, fuzzy detour basis, fuzzy detour number, fuzzy detour blocks and investigate some of their properties. It has been proved that, for a complete fuzzy graph G, the set of any pair of vertices in G is a fuzzy detour covering. A necessary and sufficient condition for a complete fuzzy graph to become a fuzzy detour block is also established. It has been proved that for a fuzzy tree there exists a nested chain of sets, where each set is a fuzzy detour convex. Application of fuzzy detour covering and fuzzy detour basis is also presented.  </description><subject>Apexes</subject><subject>Convexity</subject><subject>Fuzzy sets</subject><subject>Graph theory</subject><subject>Set theory</subject><issn>1309-4653</issn><issn>1309-4653</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>ALSLI</sourceid><sourceid>CJNVE</sourceid><sourceid>M0P</sourceid><sourceid>PIMPY</sourceid><recordid>eNpdkE1Lw0AQhhdRsNT-Aw8Bz4mzH5ns3pRoq1Dwoudlk2w0xSZxNwmmv76xrSCeZuB5eWd4CLmmENEkQXbb9S5vtqaLBsoqFlGp5BmZUQ4qFBjz8z_7JVl4vwEAGidCSpyRu2W_243Bg-2a3gVpUw_2u-rGwNRF8A8N1lX1e1DVJ7Bypv3wV-SiNJ_eLk5zTt6Wj6_pU7h-WT2n9-swp4J3IVVKiEJaxgVmUHLLFYIpQaAtUWQFWhnH3GRMSASGFhmqCSgoqMwkAJ-Tm2Nv65qv3vpOb6a36umkZsgEqoSimFLimMpd472zpW5dtTVu1BT0QZf-1aUPuvSPLr4HBvZfdw</recordid><startdate>20210411</startdate><enddate>20210411</enddate><creator>Rajeshkumar, R</creator><creator>Anto, A M</creator><general>Ninety Nine Publication</general><scope>AAYXX</scope><scope>CITATION</scope><scope>0-V</scope><scope>3V.</scope><scope>7XB</scope><scope>88B</scope><scope>88I</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ALSLI</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>CJNVE</scope><scope>DWQXO</scope><scope>EDSIH</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>M0N</scope><scope>M0P</scope><scope>M2P</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEDU</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope></search><sort><creationdate>20210411</creationdate><title>Fuzzy Detour Convexity and Fuzzy Detour Covering in Fuzzy Graphs</title><author>Rajeshkumar, R ; Anto, A M</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c143t-19944d8e2346b0f3e3960af046ef64bd6e8553ab2486026e6269f6490d18b8003</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Apexes</topic><topic>Convexity</topic><topic>Fuzzy sets</topic><topic>Graph theory</topic><topic>Set theory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Rajeshkumar, R</creatorcontrib><creatorcontrib>Anto, A M</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Social Sciences Premium Collection</collection><collection>ProQuest Central (Corporate)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Education Database (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Social Science Premium Collection</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>Education Collection</collection><collection>ProQuest Central Korea</collection><collection>Turkey Database</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Computing Database</collection><collection>Education Database</collection><collection>Science Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Education</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>Turkish journal of computer and mathematics education</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Rajeshkumar, R</au><au>Anto, A M</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Fuzzy Detour Convexity and Fuzzy Detour Covering in Fuzzy Graphs</atitle><jtitle>Turkish journal of computer and mathematics education</jtitle><date>2021-04-11</date><risdate>2021</risdate><volume>12</volume><issue>2</issue><spage>2170</spage><epage>2175</epage><pages>2170-2175</pages><issn>1309-4653</issn><eissn>1309-4653</eissn><abstract>A path P connecting a pair of vertices in a connected fuzzy graph is called a fuzzy detour, if its μ - length is maximum among all the feasible paths between them. In this paper we establish the notion of fuzzy detour convex sets, fuzzy detour covering, fuzzy detour basis, fuzzy detour number, fuzzy detour blocks and investigate some of their properties. It has been proved that, for a complete fuzzy graph G, the set of any pair of vertices in G is a fuzzy detour covering. A necessary and sufficient condition for a complete fuzzy graph to become a fuzzy detour block is also established. It has been proved that for a fuzzy tree there exists a nested chain of sets, where each set is a fuzzy detour convex. Application of fuzzy detour covering and fuzzy detour basis is also presented.  </abstract><cop>Gurgaon</cop><pub>Ninety Nine Publication</pub><doi>10.17762/turcomat.v12i2.1898</doi><tpages>6</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1309-4653
ispartof Turkish journal of computer and mathematics education, 2021-04, Vol.12 (2), p.2170-2175
issn 1309-4653
1309-4653
language eng
recordid cdi_proquest_journals_2624697164
source Publicly Available Content Database; Social Science Premium Collection; Education Collection
subjects Apexes
Convexity
Fuzzy sets
Graph theory
Set theory
title Fuzzy Detour Convexity and Fuzzy Detour Covering in Fuzzy Graphs
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T21%3A53%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Fuzzy%20Detour%20Convexity%20and%20Fuzzy%20Detour%20Covering%20in%20Fuzzy%20Graphs&rft.jtitle=Turkish%20journal%20of%20computer%20and%20mathematics%20education&rft.au=Rajeshkumar,%20R&rft.date=2021-04-11&rft.volume=12&rft.issue=2&rft.spage=2170&rft.epage=2175&rft.pages=2170-2175&rft.issn=1309-4653&rft.eissn=1309-4653&rft_id=info:doi/10.17762/turcomat.v12i2.1898&rft_dat=%3Cproquest_cross%3E2624697164%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c143t-19944d8e2346b0f3e3960af046ef64bd6e8553ab2486026e6269f6490d18b8003%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2624697164&rft_id=info:pmid/&rfr_iscdi=true