用多数化方法得到拉普拉斯指数的更多不等式

IF 1 Q4 CHEMISTRY, MULTIDISCIPLINARY

Iranian journal of mathematical chemistry Pub Date : 2018-03-01 DOI:10.22052/IJMC.2017.100951.1317

J. Palacios

{"title":"用多数化方法得到拉普拉斯指数的更多不等式","authors":"J. Palacios","doi":"10.22052/IJMC.2017.100951.1317","DOIUrl":null,"url":null,"abstract":"The n-tuple of Laplacian characteristic values of a graph is majorized by the conjugate sequence of its degrees. Using that result we find a collection of general inequalities for a number of Laplacian indices expressed in terms of the conjugate degrees, and then with a maximality argument, we find tight general bounds expressed in terms of the size of the vertex set n and the average degree dG = 2|E|/n. We also find some particular tight bounds for some classes of graphs in terms of customary graph parameters.","PeriodicalId":14545,"journal":{"name":"Iranian journal of mathematical chemistry","volume":"4 1","pages":"17-24"},"PeriodicalIF":1.0000,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"More inequalities for Laplacian indices by way of majorization\",\"authors\":\"J. Palacios\",\"doi\":\"10.22052/IJMC.2017.100951.1317\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The n-tuple of Laplacian characteristic values of a graph is majorized by the conjugate sequence of its degrees. Using that result we find a collection of general inequalities for a number of Laplacian indices expressed in terms of the conjugate degrees, and then with a maximality argument, we find tight general bounds expressed in terms of the size of the vertex set n and the average degree dG = 2|E|/n. We also find some particular tight bounds for some classes of graphs in terms of customary graph parameters.\",\"PeriodicalId\":14545,\"journal\":{\"name\":\"Iranian journal of mathematical chemistry\",\"volume\":\"4 1\",\"pages\":\"17-24\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2018-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Iranian journal of mathematical chemistry\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22052/IJMC.2017.100951.1317\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Iranian journal of mathematical chemistry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22052/IJMC.2017.100951.1317","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 1

摘要

图的拉普拉斯特征值的n元组被它的度的共轭序列所绝大多数化。利用这一结果，我们找到了一系列用共轭度表示的拉普拉斯指标的一般不等式，然后通过极大性论证，我们找到了用顶点集n的大小和平均度dG = 2|E|/n表示的严格的一般界。我们还根据常用图参数，找到了某些图类的特定紧界。

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

查看原文本刊更多论文

More inequalities for Laplacian indices by way of majorization

The n-tuple of Laplacian characteristic values of a graph is majorized by the conjugate sequence of its degrees. Using that result we find a collection of general inequalities for a number of Laplacian indices expressed in terms of the conjugate degrees, and then with a maximality argument, we find tight general bounds expressed in terms of the size of the vertex set n and the average degree dG = 2|E|/n. We also find some particular tight bounds for some classes of graphs in terms of customary graph parameters.

求助全文

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

来源期刊

Iranian journal of mathematical chemistry CHEMISTRY, MULTIDISCIPLINARY-

CiteScore

2.10

自引率

7.70%

发文量