A Study on Degrees of all Neighbors of a Vertex in Fuzzy Graphs

Alimohammad Fallah Andevari
{"title":"A Study on Degrees of all Neighbors of a Vertex in Fuzzy Graphs","authors":"Alimohammad Fallah Andevari","doi":"10.22457/apam.v26n2a03890","DOIUrl":null,"url":null,"abstract":". Graphs are one of the main tools for the mathematical modelling of various human problems. Fuzzy graphs clearly showed their ability to solve uncertain and ambiguous problems. Let G (cid:2) (cid:3)V, σ, μ(cid:8) be a fuzzy graph and u ∈ V . We define S (cid:12)(cid:13) (cid:3)u(cid:8) (cid:2) ∑ (cid:15)(cid:16)∈ℰ μ(cid:3)vu(cid:8)deg (cid:12) v . In this paper, we present some properties of S (cid:12)(cid:13) (cid:3)u(cid:8) on fuzzy graphs and establish relations between the Zagreb indices and the sum of the degrees of all neighbors of a vertex.","PeriodicalId":305863,"journal":{"name":"Annals of Pure and Applied Mathematics","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Pure and Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22457/apam.v26n2a03890","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

. Graphs are one of the main tools for the mathematical modelling of various human problems. Fuzzy graphs clearly showed their ability to solve uncertain and ambiguous problems. Let G (cid:2) (cid:3)V, σ, μ(cid:8) be a fuzzy graph and u ∈ V . We define S (cid:12)(cid:13) (cid:3)u(cid:8) (cid:2) ∑ (cid:15)(cid:16)∈ℰ μ(cid:3)vu(cid:8)deg (cid:12) v . In this paper, we present some properties of S (cid:12)(cid:13) (cid:3)u(cid:8) on fuzzy graphs and establish relations between the Zagreb indices and the sum of the degrees of all neighbors of a vertex.
模糊图中一个顶点的邻域度的研究
. 图是对各种人类问题进行数学建模的主要工具之一。模糊图清楚地显示了他们解决不确定和模糊问题的能力。设G (cid:2) (cid:3)V, σ, μ(cid:8)为模糊图,u∈V。我们定义S (cid: 12) (cid: 13) (cid: 3) u (cid: 8) (cid: 2)∑(cid: 15) (cid: 16)∈ℰμ(cid: 3) vu (cid: 8)度(cid: 12) v。本文给出了模糊图上S (cid:12)(cid:13) (cid:3)u(cid:8)的一些性质,并建立了一个顶点的Zagreb指标与所有相邻顶点的度和之间的关系。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信