图的拼接和连接的谱多项式

IF 0.4 Q4 MATHEMATICS

Boletim Sociedade Paranaense de Matematica Pub Date : 2022-12-26 DOI:10.5269/bspm.51691

H. Ramane, Daneshwari Patil, K. Ashoka, B. Parvathalu

{"title":"图的拼接和连接的谱多项式","authors":"H. Ramane, Daneshwari Patil, K. Ashoka, B. Parvathalu","doi":"10.5269/bspm.51691","DOIUrl":null,"url":null,"abstract":"The spectral polynomial of a graph is the characteristic polynomial of its adjacency matrix. Spectral polynomial of the splice and links of complete graph and star have been obatined recently in the literature. In this paper we generalize these results using the concept of equitable partition.","PeriodicalId":44941,"journal":{"name":"Boletim Sociedade Paranaense de Matematica","volume":" ","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2022-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On spectral polynomial of splices and links of graphs\",\"authors\":\"H. Ramane, Daneshwari Patil, K. Ashoka, B. Parvathalu\",\"doi\":\"10.5269/bspm.51691\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The spectral polynomial of a graph is the characteristic polynomial of its adjacency matrix. Spectral polynomial of the splice and links of complete graph and star have been obatined recently in the literature. In this paper we generalize these results using the concept of equitable partition.\",\"PeriodicalId\":44941,\"journal\":{\"name\":\"Boletim Sociedade Paranaense de Matematica\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2022-12-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Boletim Sociedade Paranaense de Matematica\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5269/bspm.51691\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Boletim Sociedade Paranaense de Matematica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5269/bspm.51691","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

图的谱多项式是其邻接矩阵的特征多项式。最近在文献中讨论了完备图和星的拼接和链接的谱多项式。在本文中，我们使用公平分配的概念来推广这些结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On spectral polynomial of splices and links of graphs

The spectral polynomial of a graph is the characteristic polynomial of its adjacency matrix. Spectral polynomial of the splice and links of complete graph and star have been obatined recently in the literature. In this paper we generalize these results using the concept of equitable partition.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊