{"title":"最小化有符号完整图的最小拉普拉奇特征值","authors":"Dan Li, Minghui Yan, Jixiang Meng","doi":"10.1016/j.amc.2024.129002","DOIUrl":null,"url":null,"abstract":"<div><p>A signed graph Σ is a graph whose edges yield the signs ±1. Let <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> be the complete graph with <em>n</em> vertices and <span><math><mi>Σ</mi><mo>=</mo><mo>(</mo><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>,</mo><msup><mrow><mi>F</mi></mrow><mrow><mo>−</mo></mrow></msup><mo>)</mo></math></span> be a signed complete graph, where <em>F</em> is a subgraph induced by the negative edges of Σ. The least Laplacian eigenvalue of Σ is the least eigenvalue of its Laplacian matrix. A unicyclic graph is a connected graph containing exactly one cycle. In this paper, we focus on the least Laplacian eigenvalue of <span><math><mi>Σ</mi><mo>=</mo><mo>(</mo><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>,</mo><msup><mrow><mi>F</mi></mrow><mrow><mo>−</mo></mrow></msup><mo>)</mo></math></span>, where <em>F</em> is a unicyclic graph.</p></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"484 ","pages":"Article 129002"},"PeriodicalIF":3.4000,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0096300324004636/pdfft?md5=f575acb8362aad3fa0b606f548e03842&pid=1-s2.0-S0096300324004636-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Minimizing the least Laplacian eigenvalue of signed complete graphs\",\"authors\":\"Dan Li, Minghui Yan, Jixiang Meng\",\"doi\":\"10.1016/j.amc.2024.129002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>A signed graph Σ is a graph whose edges yield the signs ±1. Let <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> be the complete graph with <em>n</em> vertices and <span><math><mi>Σ</mi><mo>=</mo><mo>(</mo><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>,</mo><msup><mrow><mi>F</mi></mrow><mrow><mo>−</mo></mrow></msup><mo>)</mo></math></span> be a signed complete graph, where <em>F</em> is a subgraph induced by the negative edges of Σ. The least Laplacian eigenvalue of Σ is the least eigenvalue of its Laplacian matrix. A unicyclic graph is a connected graph containing exactly one cycle. In this paper, we focus on the least Laplacian eigenvalue of <span><math><mi>Σ</mi><mo>=</mo><mo>(</mo><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>,</mo><msup><mrow><mi>F</mi></mrow><mrow><mo>−</mo></mrow></msup><mo>)</mo></math></span>, where <em>F</em> is a unicyclic graph.</p></div>\",\"PeriodicalId\":55496,\"journal\":{\"name\":\"Applied Mathematics and Computation\",\"volume\":\"484 \",\"pages\":\"Article 129002\"},\"PeriodicalIF\":3.4000,\"publicationDate\":\"2025-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S0096300324004636/pdfft?md5=f575acb8362aad3fa0b606f548e03842&pid=1-s2.0-S0096300324004636-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Mathematics and Computation\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0096300324004636\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2024/8/12 0:00:00\",\"PubModel\":\"Epub\",\"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/S0096300324004636","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/8/12 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
摘要
有符号图 Σ 是一个图，其边的符号为 ±1。 设 Kn 是有 n 个顶点的完整图，Σ=(Kn,F-) 是一个有符号的完整图，其中 F 是由Σ 的负边引起的子图。Σ 的最小拉普拉斯特征值是其拉普拉斯矩阵的最小特征值。单循环图是指包含一个循环的连通图。本文重点研究 Σ=(Kn,F-) 的最小拉普拉奇特征值，其中 F 是单环图。
Minimizing the least Laplacian eigenvalue of signed complete graphs
A signed graph Σ is a graph whose edges yield the signs ±1. Let be the complete graph with n vertices and be a signed complete graph, where F is a subgraph induced by the negative edges of Σ. The least Laplacian eigenvalue of Σ is the least eigenvalue of its Laplacian matrix. A unicyclic graph is a connected graph containing exactly one cycle. In this paper, we focus on the least Laplacian eigenvalue of , where F is a unicyclic graph.
期刊介绍：
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
