嫁接变换及其在块图谱半径上的应用

IF 0.5 Q4 COMPUTER SCIENCE, THEORY & METHODS

JOURNAL OF INTERCONNECTION NETWORKS Pub Date : 2024-04-06 DOI:10.1142/s0219265924500087

Yinfen Zhu, Xu Chen, Xing Chen

{"title":"嫁接变换及其在块图谱半径上的应用","authors":"Yinfen Zhu, Xu Chen, Xing Chen","doi":"10.1142/s0219265924500087","DOIUrl":null,"url":null,"abstract":"Let [Formula: see text] be a connected graph and [Formula: see text] be the adjacency matrix of [Formula: see text]. Suppose that [Formula: see text] are the eigenvalues of [Formula: see text]. In this paper, we first give a graft transformation on the spectral radius of graphs and then as their application, we determine the extremal graphs with maximum and minimum spectral radii among all clique trees. Furthermore, we also determine the unique graph with maximum spectral radius among all block graphs by using different methods.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2024-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Graft Transformation and Their Application on the Spectral Radius of Block Graphs\",\"authors\":\"Yinfen Zhu, Xu Chen, Xing Chen\",\"doi\":\"10.1142/s0219265924500087\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let [Formula: see text] be a connected graph and [Formula: see text] be the adjacency matrix of [Formula: see text]. Suppose that [Formula: see text] are the eigenvalues of [Formula: see text]. In this paper, we first give a graft transformation on the spectral radius of graphs and then as their application, we determine the extremal graphs with maximum and minimum spectral radii among all clique trees. Furthermore, we also determine the unique graph with maximum spectral radius among all block graphs by using different methods.\",\"PeriodicalId\":53990,\"journal\":{\"name\":\"JOURNAL OF INTERCONNECTION NETWORKS\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2024-04-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"JOURNAL OF INTERCONNECTION NETWORKS\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s0219265924500087\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"JOURNAL OF INTERCONNECTION NETWORKS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0219265924500087","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

设[公式：见正文]是一个连通图，[公式：见正文]是[公式：见正文]的邻接矩阵。假设[公式：见正文]是[公式：见正文]的特征值。本文首先给出了图谱半径的嫁接变换，然后作为其应用，确定了所有簇树中谱半径最大和最小的极值图。此外，我们还通过不同的方法确定了所有块图中具有最大谱半径的唯一图。

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

查看原文本刊更多论文

The Graft Transformation and Their Application on the Spectral Radius of Block Graphs

Let [Formula: see text] be a connected graph and [Formula: see text] be the adjacency matrix of [Formula: see text]. Suppose that [Formula: see text] are the eigenvalues of [Formula: see text]. In this paper, we first give a graft transformation on the spectral radius of graphs and then as their application, we determine the extremal graphs with maximum and minimum spectral radii among all clique trees. Furthermore, we also determine the unique graph with maximum spectral radius among all block graphs by using different methods.

求助全文

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

来源期刊

JOURNAL OF INTERCONNECTION NETWORKS COMPUTER SCIENCE, THEORY & METHODS-

自引率

14.30%

发文量

121

期刊介绍： The Journal of Interconnection Networks (JOIN) is an international scientific journal dedicated to advancing the state-of-the-art of interconnection networks. The journal addresses all aspects of interconnection networks including their theory, analysis, design, implementation and application, and corresponding issues of communication, computing and function arising from (or applied to) a variety of multifaceted networks. Interconnection problems occur at different levels in the hardware and software design of communicating entities in integrated circuits, multiprocessors, multicomputers, and communication networks as diverse as telephone systems, cable network systems, computer networks, mobile communication networks, satellite network systems, the Internet and biological systems.