Distance (signless) Laplacian spectra and energies of two classes of cyclic polyomino chains

IF 3.4 2区 数学 Q1 MATHEMATICS, APPLIED Applied Mathematics and Computation Pub Date : 2025-02-15 Epub Date: 2024-10-10 DOI:10.1016/j.amc.2024.129099
Yonghong Zhang , Ligong Wang
{"title":"Distance (signless) Laplacian spectra and energies of two classes of cyclic polyomino chains","authors":"Yonghong Zhang ,&nbsp;Ligong Wang","doi":"10.1016/j.amc.2024.129099","DOIUrl":null,"url":null,"abstract":"<div><div>Let <span><math><mi>D</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> and <span><math><mi>T</mi><mi>r</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> be the distance matrix and the diagonal matrix of vertex transmissions of a graph <em>G</em>, respectively. The distance Laplacian matrix and the distance signless Laplacian matrix of <em>G</em> are defined as <span><math><msup><mrow><mi>D</mi></mrow><mrow><mi>L</mi></mrow></msup><mo>(</mo><mi>G</mi><mo>)</mo><mo>=</mo><mi>T</mi><mi>r</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>−</mo><mi>D</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> and <span><math><msup><mrow><mi>D</mi></mrow><mrow><mi>Q</mi></mrow></msup><mo>(</mo><mi>G</mi><mo>)</mo><mo>=</mo><mi>T</mi><mi>r</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>+</mo><mi>D</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span>, respectively. In this paper, we consider the distance Laplacian spectra and the distance signless Laplacian spectra of the linear cyclic polyomino chain <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> and the Möbius cyclic polyomino chain <span><math><msub><mrow><mi>M</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>. By utilizing the properties of circulant matrices, we give the characteristic polynomials and the eigenvalues for the distance Laplacian matrices and the distance signless Laplacian matrices of the graphs <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> and <span><math><msub><mrow><mi>M</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>, respectively. Furthermore, we provide the exactly values of the distance Laplacian energy and the distance signless Laplacian energy of the graph <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>, and the upper bounds on the distance Laplacian energy and the distance signless Laplacian energy of the graph <span><math><msub><mrow><mi>M</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>, respectively.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"487 ","pages":"Article 129099"},"PeriodicalIF":3.4000,"publicationDate":"2025-02-15","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/S0096300324005605","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/10/10 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

Let D(G) and Tr(G) be the distance matrix and the diagonal matrix of vertex transmissions of a graph G, respectively. The distance Laplacian matrix and the distance signless Laplacian matrix of G are defined as DL(G)=Tr(G)D(G) and DQ(G)=Tr(G)+D(G), respectively. In this paper, we consider the distance Laplacian spectra and the distance signless Laplacian spectra of the linear cyclic polyomino chain Fn and the Möbius cyclic polyomino chain Mn. By utilizing the properties of circulant matrices, we give the characteristic polynomials and the eigenvalues for the distance Laplacian matrices and the distance signless Laplacian matrices of the graphs Fn and Mn, respectively. Furthermore, we provide the exactly values of the distance Laplacian energy and the distance signless Laplacian energy of the graph Fn, and the upper bounds on the distance Laplacian energy and the distance signless Laplacian energy of the graph Mn, respectively.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
两类环状多臂链的距离(无符号)拉普拉斯谱和能量
设 D(G) 和 Tr(G) 分别为图 G 的距离矩阵和顶点传输对角矩阵。G 的距离拉普拉斯矩阵和距离无符号拉普拉斯矩阵分别定义为 DL(G)=Tr(G)-D(G) 和 DQ(G)=Tr(G)+D(G) 。本文考虑线性循环多角体链 Fn 和莫比乌斯循环多角体链 Mn 的距离拉普拉斯谱和距离无符号拉普拉斯谱。利用循环矩阵的性质,我们分别给出了图形 Fn 和 Mn 的距离拉普拉斯矩阵和无距离拉普拉斯矩阵的特征多项式和特征值。此外,我们还分别给出了图 Fn 的距离拉普拉奇能量和无符号距离拉普拉奇能量的精确值,以及图 Mn 的距离拉普拉奇能量和无符号距离拉普拉奇能量的上限。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
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.
期刊最新文献
A generic scheme for the time-dependent navier-Stokes equations coupled with the heat equation on general meshes Asynchronous observer-based control for continuous-time singularly perturbed jump systems: A new Lyapunov function Model-free safe synchronization control of high-order nonlinear multi-agent systems based on finite-time data-driven fuzzy predictor Informational coarsening in networked discrete public goods games Simplified reinforcement learning-based distributed consensus neural network control for second-order uncertain nonlinear multi-agent systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1