A note on Laplacian coefficients of the characteristic polynomial of a complete graph

Q3 Engineering 推进技术 Pub Date : 2023-12-03 DOI:10.52783/tjjpt.v44.i5.2763
B. Prashanth, Madusudan. K. V, Abhishek M, Mahesha
{"title":"A note on Laplacian coefficients of the characteristic polynomial of a complete graph","authors":"B. Prashanth, Madusudan. K. V, Abhishek M, Mahesha","doi":"10.52783/tjjpt.v44.i5.2763","DOIUrl":null,"url":null,"abstract":"We have discovered the distinctive polynomial of the complete graph’s Laplacian matrix with this article in mind. The trace of the Laplacian matrix and the total number of vertices in the complete graph were used to determine the coefficients of the characteristic polynomial. Additionally, we have demonstrated that Laplacian eigenvalues can be used to get coefficients for identical characteristic polynomials. Can be used to get coefficients for identical characteristic polynomials. \n ","PeriodicalId":39883,"journal":{"name":"推进技术","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"推进技术","FirstCategoryId":"1087","ListUrlMain":"https://doi.org/10.52783/tjjpt.v44.i5.2763","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

Abstract

We have discovered the distinctive polynomial of the complete graph’s Laplacian matrix with this article in mind. The trace of the Laplacian matrix and the total number of vertices in the complete graph were used to determine the coefficients of the characteristic polynomial. Additionally, we have demonstrated that Laplacian eigenvalues can be used to get coefficients for identical characteristic polynomials. Can be used to get coefficients for identical characteristic polynomials.  
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
关于完整图形特征多项式拉普拉奇系数的说明
在此基础上,我们发现了完全图的拉普拉斯矩阵的独特多项式。利用拉普拉斯矩阵的迹线和完全图的顶点总数确定特征多项式的系数。此外,我们已经证明了拉普拉斯特征值可以用来获得相同特征多项式的系数。可以用来得到相同特征多项式的系数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
推进技术
推进技术 Engineering-Aerospace Engineering
CiteScore
1.40
自引率
0.00%
发文量
6610
期刊介绍:
期刊最新文献
Ensemble XMOB Approach for Brain Tumor Detection Based on Feature Extraction Inverse Double Domination in Graphs Advancing Hardware Security: A Review and Novel Design of Configurable Arbiter PUF with DCM-Induced Metastability for Enhanced Resource Efficiency and Unpredictability Neuroguard:Unveiling the Strength of Lightfooted Anomaly Detection with Swift-Net Neural Networks in Countering Network Threats Moderating Role of Corporate Social Responsibility for the Effect of Managerial Ability on Financial Performance: Evidence from an Emerging Economy
×
引用
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