若干图型的随机和Sombor特征多项式系数

IF 0.7 Q2 MATHEMATICS
M. Oz
{"title":"若干图型的随机和Sombor特征多项式系数","authors":"M. Oz","doi":"10.31801/cfsuasmas.1080426","DOIUrl":null,"url":null,"abstract":"Let GG be a graph. The energy of GG is defined as the summation of absolute values of the eigenvalues of the adjacency matrix of GG. It is possible to study several types of graph energy originating from defining various adjacency matrices defined by correspondingly different types of graph invariants. The first step is computing the characteristic polynomial of the defined adjacency matrix of GG for obtaining the corresponding energy of GG. In this paper, formulae for the coefficients of the characteristic polynomials of both the Randic and the Sombor adjacency matrices of path graph PnPn , cycle graph CnCn are presented. Moreover, we obtain the five coefficients of the characteristic polynomials of both Randic and Sombor adjacency matrices of a special type of 3−regular graph RnRn.","PeriodicalId":44692,"journal":{"name":"Communications Faculty of Sciences University of Ankara-Series A1 Mathematics and Statistics","volume":" ","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2022-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Coefficients of Randic and Sombor characteristic polynomials of some graph types\",\"authors\":\"M. Oz\",\"doi\":\"10.31801/cfsuasmas.1080426\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let GG be a graph. The energy of GG is defined as the summation of absolute values of the eigenvalues of the adjacency matrix of GG. It is possible to study several types of graph energy originating from defining various adjacency matrices defined by correspondingly different types of graph invariants. The first step is computing the characteristic polynomial of the defined adjacency matrix of GG for obtaining the corresponding energy of GG. In this paper, formulae for the coefficients of the characteristic polynomials of both the Randic and the Sombor adjacency matrices of path graph PnPn , cycle graph CnCn are presented. Moreover, we obtain the five coefficients of the characteristic polynomials of both Randic and Sombor adjacency matrices of a special type of 3−regular graph RnRn.\",\"PeriodicalId\":44692,\"journal\":{\"name\":\"Communications Faculty of Sciences University of Ankara-Series A1 Mathematics and Statistics\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2022-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Communications Faculty of Sciences University of Ankara-Series A1 Mathematics and Statistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.31801/cfsuasmas.1080426\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Communications Faculty of Sciences University of Ankara-Series A1 Mathematics and Statistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31801/cfsuasmas.1080426","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

设GG是一个图。GG的能量被定义为GG的邻接矩阵的特征值的绝对值的总和。可以研究由相应不同类型的图不变量定义的各种邻接矩阵所产生的几种类型的图能量。第一步是计算已定义的GG邻接矩阵的特征多项式,以获得GG的相应能量。本文给出了路径图PnPn、循环图CnCn的Randic和Sombor邻接矩阵特征多项式的系数公式。此外,我们还得到了一类特殊类型的3-正则图RnRn的Randic和Sombor邻接矩阵的特征多项式的五个系数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Coefficients of Randic and Sombor characteristic polynomials of some graph types
Let GG be a graph. The energy of GG is defined as the summation of absolute values of the eigenvalues of the adjacency matrix of GG. It is possible to study several types of graph energy originating from defining various adjacency matrices defined by correspondingly different types of graph invariants. The first step is computing the characteristic polynomial of the defined adjacency matrix of GG for obtaining the corresponding energy of GG. In this paper, formulae for the coefficients of the characteristic polynomials of both the Randic and the Sombor adjacency matrices of path graph PnPn , cycle graph CnCn are presented. Moreover, we obtain the five coefficients of the characteristic polynomials of both Randic and Sombor adjacency matrices of a special type of 3−regular graph RnRn.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
61
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信