具有相同谱半径的图的公平划分构造

IF 3.4 2区数学 Q1 MATHEMATICS, APPLIED

Applied Mathematics and Computation Pub Date : 2025-08-27 DOI:10.1016/j.amc.2025.129696

Milica Anđelić , Carlos M. da Fonseca , Zoran Stanić

{"title":"具有相同谱半径的图的公平划分构造","authors":"Milica Anđelić , Carlos M. da Fonseca , Zoran Stanić","doi":"10.1016/j.amc.2025.129696","DOIUrl":null,"url":null,"abstract":"<div><div>An equitable partition of a graph is a remarkable tool that provides valuable spectral information. Among other properties, it is known that the spectral radius of the divisor matrix of any equitable partition equals the spectral radius of the graph. Recently, several methods for construction of families of graphs with the same spectral radius emerged in the literature. In this paper, we develop a unified approach to cyclic-graph constructions by formulating a general method for generating families of connected graphs with a common spectral radius, grounded in the theory of equitable partitions.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"510 ","pages":"Article 129696"},"PeriodicalIF":3.4000,"publicationDate":"2025-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An equitable partition based construction of graphs with the same spectral radius\",\"authors\":\"Milica Anđelić , Carlos M. da Fonseca , Zoran Stanić\",\"doi\":\"10.1016/j.amc.2025.129696\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>An equitable partition of a graph is a remarkable tool that provides valuable spectral information. Among other properties, it is known that the spectral radius of the divisor matrix of any equitable partition equals the spectral radius of the graph. Recently, several methods for construction of families of graphs with the same spectral radius emerged in the literature. In this paper, we develop a unified approach to cyclic-graph constructions by formulating a general method for generating families of connected graphs with a common spectral radius, grounded in the theory of equitable partitions.</div></div>\",\"PeriodicalId\":55496,\"journal\":{\"name\":\"Applied Mathematics and Computation\",\"volume\":\"510 \",\"pages\":\"Article 129696\"},\"PeriodicalIF\":3.4000,\"publicationDate\":\"2025-08-27\",\"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/S0096300325004229\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Mathematics and Computation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0096300325004229","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

摘要

图的公平划分是提供有价值的谱信息的重要工具。除其他性质外，已知任何均衡划分的除数矩阵的谱半径等于图的谱半径。近年来，文献中出现了几种构造具有相同谱半径的图族的方法。在本文中，我们开发了一个统一的方法来循环图的构造，通过制定一个一般的方法来生成具有共同谱半径的连通图族，在公平划分理论的基础上。

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

查看原文本刊更多论文

An equitable partition based construction of graphs with the same spectral radius

An equitable partition of a graph is a remarkable tool that provides valuable spectral information. Among other properties, it is known that the spectral radius of the divisor matrix of any equitable partition equals the spectral radius of the graph. Recently, several methods for construction of families of graphs with the same spectral radius emerged in the literature. In this paper, we develop a unified approach to cyclic-graph constructions by formulating a general method for generating families of connected graphs with a common spectral radius, grounded in the theory of equitable partitions.

求助全文

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

来源期刊

Applied Mathematics and Computation 数学-应用数学

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.