Graphs preserving total distance upon vertex removal

Q2 Mathematics
Snježana Majstorović, Martin Knor, Riste Škrekovski
{"title":"Graphs preserving total distance upon vertex removal","authors":"Snježana Majstorović,&nbsp;Martin Knor,&nbsp;Riste Škrekovski","doi":"10.1016/j.endm.2018.06.019","DOIUrl":null,"url":null,"abstract":"<div><p>The total distance or Wiener index <span><math><mi>W</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> of a connected graph <em>G</em> is defined as the sum of distances between all pairs of vertices in <em>G</em>. In 1991, Šoltés posed the problem of finding all graphs <em>G</em> such that the equality <span><math><mi>W</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>=</mo><mi>W</mi><mo>(</mo><mi>G</mi><mo>−</mo><mi>v</mi><mo>)</mo></math></span> holds for all their vertices <em>v</em>. Up to now, the only known graph with this property is the cycle <em>C</em><sub>11</sub>. Our main object of study is a relaxed version of this problem: Find graphs for which total distance does not change when a particular vertex is removed. We show that there are infinitely many graphs that satisfy this property. This gives hope that Šoltes's problem may have also some solutions distinct from <em>C</em><sub>11</sub>.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.06.019","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571065318301100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 1

Abstract

The total distance or Wiener index W(G) of a connected graph G is defined as the sum of distances between all pairs of vertices in G. In 1991, Šoltés posed the problem of finding all graphs G such that the equality W(G)=W(Gv) holds for all their vertices v. Up to now, the only known graph with this property is the cycle C11. Our main object of study is a relaxed version of this problem: Find graphs for which total distance does not change when a particular vertex is removed. We show that there are infinitely many graphs that satisfy this property. This gives hope that Šoltes's problem may have also some solutions distinct from C11.

顶点移除后保持总距离的图
连通图G的总距离或维纳指数W(G)被定义为G中所有顶点对之间的距离和。1991年,Šoltés提出了一个问题,即找到所有图G,使得等式W(G)=W(G−v)对所有顶点v都成立。到目前为止,唯一已知的具有这个性质的图是循环C11。我们的主要研究对象是这个问题的一个宽松版本:找到当移除一个特定顶点时总距离不改变的图。我们证明有无穷多个图满足这个性质。这给了人们希望,Šoltes的问题可能也有一些不同于C11的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Electronic Notes in Discrete Mathematics
Electronic Notes in Discrete Mathematics Mathematics-Discrete Mathematics and Combinatorics
CiteScore
1.30
自引率
0.00%
发文量
0
期刊介绍: Electronic Notes in Discrete Mathematics is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication is appropriate. Organizers of conferences whose proceedings appear in Electronic Notes in Discrete Mathematics, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信