Minimizing the least Laplacian eigenvalue of signed complete graphs

Dan Li, Minghui Yan and Jixiang Meng

Applied Mathematics and Computation, 2025, vol. 484, issue C

Abstract: A signed graph Σ is a graph whose edges yield the signs ±1. Let Kn be the complete graph with n vertices and Σ=(Kn,F−) 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 Σ=(Kn,F−), where F is a unicyclic graph.

Keywords: Least Laplacian eigenvalue; Signed complete graphs (search for similar items in EconPapers)
Date: 2025
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324004636
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:484:y:2025:i:c:s0096300324004636

DOI: 10.1016/j.amc.2024.129002

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().