{"title":"图的Eliasi-Taeri和的倒度距","authors":"K. Pattabiraman, M. Bhat","doi":"10.47443/ejm.2022.008","DOIUrl":null,"url":null,"abstract":"For a connected graph G , the reciprocal degree distance is defined as RDD ( G ) = (cid:80) u,v ∈ V ( G ) (cid:0) d G ( u ) + d G ( v ) (cid:1)(cid:0) 2 d G ( u, v ) (cid:1) − 1 , where d G ( u ) denotes the degree of a vertex u in G and d G ( u, v ) represents the distance between the vertices u and v in G . In this paper, upper bounds for the reciprocal degree distance of graphs, arising from four operations introduced by Eliasi and Taeri in [ Discrete Appl. Math. 157 (2009) 794–803], are provided.","PeriodicalId":29770,"journal":{"name":"International Electronic Journal of Mathematics Education","volume":"17 1","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2022-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Reciprocal Degree Distance of Eliasi-Taeri Sums of Graphs\",\"authors\":\"K. Pattabiraman, M. Bhat\",\"doi\":\"10.47443/ejm.2022.008\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For a connected graph G , the reciprocal degree distance is defined as RDD ( G ) = (cid:80) u,v ∈ V ( G ) (cid:0) d G ( u ) + d G ( v ) (cid:1)(cid:0) 2 d G ( u, v ) (cid:1) − 1 , where d G ( u ) denotes the degree of a vertex u in G and d G ( u, v ) represents the distance between the vertices u and v in G . In this paper, upper bounds for the reciprocal degree distance of graphs, arising from four operations introduced by Eliasi and Taeri in [ Discrete Appl. Math. 157 (2009) 794–803], are provided.\",\"PeriodicalId\":29770,\"journal\":{\"name\":\"International Electronic Journal of Mathematics Education\",\"volume\":\"17 1\",\"pages\":\"\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2022-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Electronic Journal of Mathematics Education\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.47443/ejm.2022.008\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"EDUCATION & EDUCATIONAL RESEARCH\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Electronic Journal of Mathematics Education","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47443/ejm.2022.008","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"EDUCATION & EDUCATIONAL RESEARCH","Score":null,"Total":0}
引用次数: 0
摘要
连通图G,互惠程度距离被定义为抽样(G) = (cid: 80) u, v v (G)∈(cid: 0) d G (u) + d G (v) (cid): 1) (cid: 0) 2 d G (u, v) (cid): 1)−1,在d G (u)表示一个顶点的度u G和d G (u, v)表示顶点之间的距离在G u和v。本文讨论了由Eliasi和Taeri在[离散应用]中引入的四种操作引起的图的倒易度距离的上界。数学。157(2009)794-803]，提供。
Reciprocal Degree Distance of Eliasi-Taeri Sums of Graphs
For a connected graph G , the reciprocal degree distance is defined as RDD ( G ) = (cid:80) u,v ∈ V ( G ) (cid:0) d G ( u ) + d G ( v ) (cid:1)(cid:0) 2 d G ( u, v ) (cid:1) − 1 , where d G ( u ) denotes the degree of a vertex u in G and d G ( u, v ) represents the distance between the vertices u and v in G . In this paper, upper bounds for the reciprocal degree distance of graphs, arising from four operations introduced by Eliasi and Taeri in [ Discrete Appl. Math. 157 (2009) 794–803], are provided.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
