A graph discretization of vector Laplacian

IF 1 3区 数学 Q3 MATHEMATICS, APPLIED
Shu Li , Lu Lu , Jianfeng Wang
{"title":"A graph discretization of vector Laplacian","authors":"Shu Li ,&nbsp;Lu Lu ,&nbsp;Jianfeng Wang","doi":"10.1016/j.dam.2025.09.019","DOIUrl":null,"url":null,"abstract":"<div><div>As known, the scalar Laplacian gives the celebrated Laplacian matrix of a graph. In this paper, we determine the graph matrix presentation of vector Laplacian (or Helmholtz operator), named as Helmholtzian matrix. To compare the difference and similarity with previous graph matrices, we study the limit points of spectral radius and characterize the connected graphs with spectral radius at most 4.38+ via Helmholtzian matrix. Finally, we discuss the potential applications of Helmholtzian spectra of graphs in the simplicial networks and small-world networks.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"379 ","pages":"Pages 446-460"},"PeriodicalIF":1.0000,"publicationDate":"2025-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X25005451","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

As known, the scalar Laplacian gives the celebrated Laplacian matrix of a graph. In this paper, we determine the graph matrix presentation of vector Laplacian (or Helmholtz operator), named as Helmholtzian matrix. To compare the difference and similarity with previous graph matrices, we study the limit points of spectral radius and characterize the connected graphs with spectral radius at most 4.38+ via Helmholtzian matrix. Finally, we discuss the potential applications of Helmholtzian spectra of graphs in the simplicial networks and small-world networks.
向量拉普拉斯的图离散化
众所周知,标量拉普拉斯矩阵给出了著名的图的拉普拉斯矩阵。本文确定了向量拉普拉斯算子(或亥姆霍兹算子)的图矩阵表示形式,称为亥姆霍兹矩阵。为了比较与以往图矩阵的异同,我们研究了谱半径的极限点,并利用Helmholtzian矩阵对谱半径不超过4.38+的连通图进行了表征。最后讨论了图的Helmholtzian谱在简单网络和小世界网络中的潜在应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Discrete Applied Mathematics
Discrete Applied Mathematics 数学-应用数学
CiteScore
2.30
自引率
9.10%
发文量
422
审稿时长
4.5 months
期刊介绍: The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal. Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信