Computing Szeged Index of Graphs on Triples

IF 1 Q4 CHEMISTRY, MULTIDISCIPLINARY Iranian journal of mathematical chemistry Pub Date : 2017-06-01 DOI:10.22052/IJMC.2017.80007.1275
M. Darafsheh, R. Modabernia, M. Namdari
{"title":"Computing Szeged Index of Graphs on Triples","authors":"M. Darafsheh, R. Modabernia, M. Namdari","doi":"10.22052/IJMC.2017.80007.1275","DOIUrl":null,"url":null,"abstract":"ABSTRACT Let ‎G=(V,E) ‎be a‎ ‎simple ‎connected ‎graph ‎with ‎vertex ‎set ‎V‎‎‎ ‎and ‎edge ‎set ‎‎‎E. ‎The Szeged index ‎of ‎‎G is defined by ‎ where ‎ respectively ‎ ‎ is the number of vertices of ‎G ‎closer to ‎u‎ (‎‎respectively v)‎ ‎‎than ‎‎‎v (‎‎respectively u‎).‎ ‎‎If ‎‎‎‎S ‎is a‎ ‎set ‎of ‎size‎ ‎ ‎ ‎let ‎‎V ‎be ‎the ‎set ‎of ‎all ‎subsets ‎of ‎‎S ‎of ‎size ‎3. ‎Then ‎we ‎define ‎three ‎‎types ‎of ‎intersection ‎graphs ‎with ‎vertex ‎set V. These graphs are denoted by ‎‎ ‎‎ and we will find their ‎Szeged ‎indices.‎","PeriodicalId":14545,"journal":{"name":"Iranian journal of mathematical chemistry","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Iranian journal of mathematical chemistry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22052/IJMC.2017.80007.1275","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 1

Abstract

ABSTRACT Let ‎G=(V,E) ‎be a‎ ‎simple ‎connected ‎graph ‎with ‎vertex ‎set ‎V‎‎‎ ‎and ‎edge ‎set ‎‎‎E. ‎The Szeged index ‎of ‎‎G is defined by ‎ where ‎ respectively ‎ ‎ is the number of vertices of ‎G ‎closer to ‎u‎ (‎‎respectively v)‎ ‎‎than ‎‎‎v (‎‎respectively u‎).‎ ‎‎If ‎‎‎‎S ‎is a‎ ‎set ‎of ‎size‎ ‎ ‎ ‎let ‎‎V ‎be ‎the ‎set ‎of ‎all ‎subsets ‎of ‎‎S ‎of ‎size ‎3. ‎Then ‎we ‎define ‎three ‎‎types ‎of ‎intersection ‎graphs ‎with ‎vertex ‎set V. These graphs are denoted by ‎‎ ‎‎ and we will find their ‎Szeged ‎indices.‎
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
计算三元组上图的seeged索引
摘要设G=(V,E)是一个具有顶点集V和边集E的简单连通图。G的塞格德指数定义为,其中,分别表示离u更近的G的顶点数(分别为v)比离u更近的G的顶点数(分别为u)。如果‎‎‎‎‎‎‎年代的‎‎‎‎‎大小设置‎‎‎‎让‎‎‎V组是‎‎‎‎‎‎所有子集的‎‎‎‎‎大小3。然后我们定义了具有顶点集v的相交图的三种类型,这些图用表示,我们将找到它们的塞格德指数
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Iranian journal of mathematical chemistry
Iranian journal of mathematical chemistry CHEMISTRY, MULTIDISCIPLINARY-
CiteScore
2.10
自引率
7.70%
发文量
0
期刊最新文献
On the trees with given matching number and the modified first Zagreb connection index Upper and Lower Bounds for the First and Second Zagreb Indices of Quasi Bicyclic Graphs A new notion of energy of digraphs The Gutman Index and Schultz Index in the Random Phenylene Chains Steiner Wiener Index of Complete m-Ary Trees
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1