Tribonacci 立方体的莫斯塔尔指数

IF 0.7 3区 数学 Q2 MATHEMATICS Discrete Mathematics Pub Date : 2024-10-09 DOI:10.1016/j.disc.2024.114281
{"title":"Tribonacci 立方体的莫斯塔尔指数","authors":"","doi":"10.1016/j.disc.2024.114281","DOIUrl":null,"url":null,"abstract":"<div><div>Tribonacci cubes <span><math><msubsup><mrow><mi>Γ</mi></mrow><mrow><mi>n</mi></mrow><mrow><mo>(</mo><mn>3</mn><mo>)</mo></mrow></msubsup></math></span> are a class of hypercube-like cubes obtained by removing all vertices of hypercubes <span><math><msub><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> that have more than two consecutive 1s. In this paper, we calculate the Mostar index of Tribonacci cubes, which is a measure of how far the graph is from being distance-balanced and is used to study various properties of chemical graphs.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2024-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Mostar index of Tribonacci cubes\",\"authors\":\"\",\"doi\":\"10.1016/j.disc.2024.114281\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Tribonacci cubes <span><math><msubsup><mrow><mi>Γ</mi></mrow><mrow><mi>n</mi></mrow><mrow><mo>(</mo><mn>3</mn><mo>)</mo></mrow></msubsup></math></span> are a class of hypercube-like cubes obtained by removing all vertices of hypercubes <span><math><msub><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> that have more than two consecutive 1s. In this paper, we calculate the Mostar index of Tribonacci cubes, which is a measure of how far the graph is from being distance-balanced and is used to study various properties of chemical graphs.</div></div>\",\"PeriodicalId\":50572,\"journal\":{\"name\":\"Discrete Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2024-10-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0012365X24004126\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0012365X24004126","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

Tribonacci 立方体Γn(3) 是一类类似超立方体的立方体,它是通过删除超立方体 Qn 中所有连续出现两个以上 1 的顶点而得到的。本文计算 Tribonacci 立方体的莫斯塔尔指数,该指数是衡量图形距离距离平衡程度的指标,用于研究化学图形的各种性质。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
The Mostar index of Tribonacci cubes
Tribonacci cubes Γn(3) are a class of hypercube-like cubes obtained by removing all vertices of hypercubes Qn that have more than two consecutive 1s. In this paper, we calculate the Mostar index of Tribonacci cubes, which is a measure of how far the graph is from being distance-balanced and is used to study various properties of chemical graphs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Discrete Mathematics
Discrete Mathematics 数学-数学
CiteScore
1.50
自引率
12.50%
发文量
424
审稿时长
6 months
期刊介绍: Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory. Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.
期刊最新文献
Extremal bounds for pattern avoidance in multidimensional 0-1 matrices Completely regular codes with covering radius 1 and the second eigenvalue in 3-dimensional Hamming graphs Disconnected forbidden pairs force supereulerian graphs to be hamiltonian On finding the largest minimum distance of locally recoverable codes: A graph theory approach Rigid frameworks with dilation constraints
×
引用
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