Parikshit Das, Kinkar Chandra Das, Sourav Mondal, Anita Pal
{"title":"单环图和树的第一个萨格勒布谱半径","authors":"Parikshit Das, Kinkar Chandra Das, Sourav Mondal, Anita Pal","doi":"10.1007/s10878-024-01195-x","DOIUrl":null,"url":null,"abstract":"<p>In light of the successful investigation of the adjacency matrix, a significant amount of its modification is observed employing numerous topological indices. The matrix corresponding to the well-known first Zagreb index is one of them. The entries of the first Zagreb matrix are <span>\\(d_{u_i}+d_{u_j}\\)</span>, if <span>\\(u_i\\)</span> is connected to <span>\\(u_j\\)</span>; 0, otherwise, where <span>\\(d_{u_i}\\)</span> is degree of <i>i</i>-th vertex. The current work is concerned with the mathematical properties and chemical significance of the spectral radius (<span>\\(\\rho _1\\)</span>) associated with this matrix. The lower and upper bounds of <span>\\(\\rho _1\\)</span> are computed with characterizing extremal graphs for the class of unicyclic graphs and trees. The chemical connection of the first Zagreb spectral radius is established by exploring its role as a structural descriptor of molecules. The isomer discrimination ability of <span>\\(\\rho _1\\)</span> is also explained.\n</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"45 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"First zagreb spectral radius of unicyclic graphs and trees\",\"authors\":\"Parikshit Das, Kinkar Chandra Das, Sourav Mondal, Anita Pal\",\"doi\":\"10.1007/s10878-024-01195-x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In light of the successful investigation of the adjacency matrix, a significant amount of its modification is observed employing numerous topological indices. The matrix corresponding to the well-known first Zagreb index is one of them. The entries of the first Zagreb matrix are <span>\\\\(d_{u_i}+d_{u_j}\\\\)</span>, if <span>\\\\(u_i\\\\)</span> is connected to <span>\\\\(u_j\\\\)</span>; 0, otherwise, where <span>\\\\(d_{u_i}\\\\)</span> is degree of <i>i</i>-th vertex. The current work is concerned with the mathematical properties and chemical significance of the spectral radius (<span>\\\\(\\\\rho _1\\\\)</span>) associated with this matrix. The lower and upper bounds of <span>\\\\(\\\\rho _1\\\\)</span> are computed with characterizing extremal graphs for the class of unicyclic graphs and trees. The chemical connection of the first Zagreb spectral radius is established by exploring its role as a structural descriptor of molecules. The isomer discrimination ability of <span>\\\\(\\\\rho _1\\\\)</span> is also explained.\\n</p>\",\"PeriodicalId\":50231,\"journal\":{\"name\":\"Journal of Combinatorial Optimization\",\"volume\":\"45 1\",\"pages\":\"\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-07-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Optimization\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10878-024-01195-x\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-024-01195-x","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
First zagreb spectral radius of unicyclic graphs and trees
In light of the successful investigation of the adjacency matrix, a significant amount of its modification is observed employing numerous topological indices. The matrix corresponding to the well-known first Zagreb index is one of them. The entries of the first Zagreb matrix are \(d_{u_i}+d_{u_j}\), if \(u_i\) is connected to \(u_j\); 0, otherwise, where \(d_{u_i}\) is degree of i-th vertex. The current work is concerned with the mathematical properties and chemical significance of the spectral radius (\(\rho _1\)) associated with this matrix. The lower and upper bounds of \(\rho _1\) are computed with characterizing extremal graphs for the class of unicyclic graphs and trees. The chemical connection of the first Zagreb spectral radius is established by exploring its role as a structural descriptor of molecules. The isomer discrimination ability of \(\rho _1\) is also explained.
期刊介绍:
The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering.
The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.