求助PDF
{"title":"计算森林的拉普拉斯系数","authors":"A. Ghalavand, A. Ashrafi","doi":"10.1155/2022/8199547","DOIUrl":null,"url":null,"abstract":"<jats:p>Let <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M1\">\n <mi>G</mi>\n </math>\n </jats:inline-formula> be a finite simple graph with Laplacian polynomial <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M2\">\n <mi>ψ</mi>\n <mfenced open=\"(\" close=\")\">\n <mrow>\n <mi>G</mi>\n <mo>,</mo>\n <mi>λ</mi>\n </mrow>\n </mfenced>\n <mo>=</mo>\n <msubsup>\n <mrow>\n <mo>∑</mo>\n </mrow>\n <mrow>\n <mi>k</mi>\n <mo>=</mo>\n <mn>0</mn>\n </mrow>\n <mrow>\n <mi>n</mi>\n </mrow>\n </msubsup>\n <msup>\n <mrow>\n <mfenced open=\"(\" close=\")\">\n <mrow>\n <mo>−</mo>\n <mn>1</mn>\n </mrow>\n </mfenced>\n </mrow>\n <mrow>\n <mi>n</mi>\n <mo>−</mo>\n <mi>k</mi>\n </mrow>\n </msup>\n <msub>\n <mrow>\n <mi>c</mi>\n </mrow>\n <mrow>\n <mi>k</mi>\n </mrow>\n </msub>\n <msup>\n <mrow>\n <mi>λ</mi>\n </mrow>\n <mrow>\n <mi>k</mi>\n </mrow>\n </msup>\n </math>\n </jats:inline-formula>. In an earlier paper, the coefficients <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M3\">\n <msub>\n <mrow>\n <mi>c</mi>\n </mrow>\n <mrow>\n <mi>n</mi>\n <mo>−</mo>\n <mn>4</mn>\n </mrow>\n </msub>\n </math>\n </jats:inline-formula> and <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M4\">\n <msub>\n <mrow>\n <mi>c</mi>\n </mrow>\n <mrow>\n <mi>n</mi>\n <mo>−</mo>\n <mn>5</mn>\n </mrow>\n </msub>\n </math>\n </jats:inline-formula> for forests with respect to some degree-based graph invariants were computed. The aim of this paper is to continue this work by giving an exact formula for the coefficient <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M5\">\n <msub>\n <mrow>\n <mi>c</mi>\n </mrow>\n <mrow>\n <mi>n</mi>\n <mo>−</mo>\n <mn>6</mn>\n </mrow>\n </msub>\n </math>\n </jats:inline-formula>.</jats:p>","PeriodicalId":14766,"journal":{"name":"J. Appl. Math.","volume":"23 1","pages":"8199547:1-8199547:10"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Computing some Laplacian Coefficients of Forests\",\"authors\":\"A. Ghalavand, A. Ashrafi\",\"doi\":\"10.1155/2022/8199547\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<jats:p>Let <jats:inline-formula>\\n <math xmlns=\\\"http://www.w3.org/1998/Math/MathML\\\" id=\\\"M1\\\">\\n <mi>G</mi>\\n </math>\\n </jats:inline-formula> be a finite simple graph with Laplacian polynomial <jats:inline-formula>\\n <math xmlns=\\\"http://www.w3.org/1998/Math/MathML\\\" id=\\\"M2\\\">\\n <mi>ψ</mi>\\n <mfenced open=\\\"(\\\" close=\\\")\\\">\\n <mrow>\\n <mi>G</mi>\\n <mo>,</mo>\\n <mi>λ</mi>\\n </mrow>\\n </mfenced>\\n <mo>=</mo>\\n <msubsup>\\n <mrow>\\n <mo>∑</mo>\\n </mrow>\\n <mrow>\\n <mi>k</mi>\\n <mo>=</mo>\\n <mn>0</mn>\\n </mrow>\\n <mrow>\\n <mi>n</mi>\\n </mrow>\\n </msubsup>\\n <msup>\\n <mrow>\\n <mfenced open=\\\"(\\\" close=\\\")\\\">\\n <mrow>\\n <mo>−</mo>\\n <mn>1</mn>\\n </mrow>\\n </mfenced>\\n </mrow>\\n <mrow>\\n <mi>n</mi>\\n <mo>−</mo>\\n <mi>k</mi>\\n </mrow>\\n </msup>\\n <msub>\\n <mrow>\\n <mi>c</mi>\\n </mrow>\\n <mrow>\\n <mi>k</mi>\\n </mrow>\\n </msub>\\n <msup>\\n <mrow>\\n <mi>λ</mi>\\n </mrow>\\n <mrow>\\n <mi>k</mi>\\n </mrow>\\n </msup>\\n </math>\\n </jats:inline-formula>. In an earlier paper, the coefficients <jats:inline-formula>\\n <math xmlns=\\\"http://www.w3.org/1998/Math/MathML\\\" id=\\\"M3\\\">\\n <msub>\\n <mrow>\\n <mi>c</mi>\\n </mrow>\\n <mrow>\\n <mi>n</mi>\\n <mo>−</mo>\\n <mn>4</mn>\\n </mrow>\\n </msub>\\n </math>\\n </jats:inline-formula> and <jats:inline-formula>\\n <math xmlns=\\\"http://www.w3.org/1998/Math/MathML\\\" id=\\\"M4\\\">\\n <msub>\\n <mrow>\\n <mi>c</mi>\\n </mrow>\\n <mrow>\\n <mi>n</mi>\\n <mo>−</mo>\\n <mn>5</mn>\\n </mrow>\\n </msub>\\n </math>\\n </jats:inline-formula> for forests with respect to some degree-based graph invariants were computed. The aim of this paper is to continue this work by giving an exact formula for the coefficient <jats:inline-formula>\\n <math xmlns=\\\"http://www.w3.org/1998/Math/MathML\\\" id=\\\"M5\\\">\\n <msub>\\n <mrow>\\n <mi>c</mi>\\n </mrow>\\n <mrow>\\n <mi>n</mi>\\n <mo>−</mo>\\n <mn>6</mn>\\n </mrow>\\n </msub>\\n </math>\\n </jats:inline-formula>.</jats:p>\",\"PeriodicalId\":14766,\"journal\":{\"name\":\"J. Appl. Math.\",\"volume\":\"23 1\",\"pages\":\"8199547:1-8199547:10\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"J. Appl. Math.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1155/2022/8199547\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Appl. Math.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2022/8199547","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
引用
批量引用