关于传输不规则图和长垂径

IF 3.5 2区 数学 Q1 MATHEMATICS, APPLIED Applied Mathematics and Computation Pub Date : 2024-07-31 DOI:10.1016/j.amc.2024.128918
{"title":"关于传输不规则图和长垂径","authors":"","doi":"10.1016/j.amc.2024.128918","DOIUrl":null,"url":null,"abstract":"<div><p>The transmission of a vertex in a connected graph is the sum of distances from that vertex to all other vertices. A graph is transmission-irregular (TI) if no two of its vertices have the same transmission. Xu et al. (2023) <span><span>[3]</span></span> recently asked to establish methods for constructing new TI graphs from the existing ones and also about the existence of chemical TI graphs on every even order. We show that, under certain conditions, new TI graphs can be obtained from the existing TI graph <em>G</em> either by attaching pendent paths of equal length to every vertex of <em>G</em> or by attaching two pendent paths of consecutive lengths to one vertex of <em>G</em>. We also show the existence of chemical TI graphs for almost all even orders.</p></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":null,"pages":null},"PeriodicalIF":3.5000,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On transmission-irregular graphs and long pendent paths\",\"authors\":\"\",\"doi\":\"10.1016/j.amc.2024.128918\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The transmission of a vertex in a connected graph is the sum of distances from that vertex to all other vertices. A graph is transmission-irregular (TI) if no two of its vertices have the same transmission. Xu et al. (2023) <span><span>[3]</span></span> recently asked to establish methods for constructing new TI graphs from the existing ones and also about the existence of chemical TI graphs on every even order. We show that, under certain conditions, new TI graphs can be obtained from the existing TI graph <em>G</em> either by attaching pendent paths of equal length to every vertex of <em>G</em> or by attaching two pendent paths of consecutive lengths to one vertex of <em>G</em>. We also show the existence of chemical TI graphs for almost all even orders.</p></div>\",\"PeriodicalId\":55496,\"journal\":{\"name\":\"Applied Mathematics and Computation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":3.5000,\"publicationDate\":\"2024-07-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Mathematics and Computation\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0096300324003795\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Mathematics and Computation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0096300324003795","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

连通图中一个顶点的传输是该顶点到所有其他顶点的距离之和。如果一个图中没有两个顶点具有相同的传输,那么这个图就是传输不规则图(TI)。Xu 等人(2023 年)最近要求建立从现有图中构造新 TI 图的方法,以及在每个偶数阶上存在化学 TI 图的问题。我们证明了在某些条件下,可以从现有的 TI 图中得到新的 TI 图,方法是在 TI 图的每个顶点上附加等长的下垂路径,或者在 TI 图的一个顶点上附加两条连续长度的下垂路径。 我们还证明了几乎所有偶数阶都存在化学 TI 图。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On transmission-irregular graphs and long pendent paths

The transmission of a vertex in a connected graph is the sum of distances from that vertex to all other vertices. A graph is transmission-irregular (TI) if no two of its vertices have the same transmission. Xu et al. (2023) [3] recently asked to establish methods for constructing new TI graphs from the existing ones and also about the existence of chemical TI graphs on every even order. We show that, under certain conditions, new TI graphs can be obtained from the existing TI graph G either by attaching pendent paths of equal length to every vertex of G or by attaching two pendent paths of consecutive lengths to one vertex of G. We also show the existence of chemical TI graphs for almost all even orders.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
7.90
自引率
10.00%
发文量
755
审稿时长
36 days
期刊介绍: Applied Mathematics and Computation addresses work at the interface between applied mathematics, numerical computation, and applications of systems – oriented ideas to the physical, biological, social, and behavioral sciences, and emphasizes papers of a computational nature focusing on new algorithms, their analysis and numerical results. In addition to presenting research papers, Applied Mathematics and Computation publishes review articles and single–topics issues.
期刊最新文献
Mass conservation in the validation of fluid-poroelastic structure interaction solvers Evolution of cooperation with asymmetric rewards A robust shape model for blood vessels analysis Efficient spectral element method for the Euler equations on unbounded domains Signed total Roman domination and domatic numbers in graphs
×
引用
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