arXiv 1305.21472013-05-09math.SPmath.CO

When the largest eigenvalue of the modularity and normalized modularity matrix is zero

Marianna Bolla, Brian Bullins, Sorathan Chaturapruek, Shiwen Chen, Katalin Friedl

英文摘要：

In July 2012, at the Conference on Applications of Graph Spectra in Computer Science, Barcelona, D. Stevanovic posed the following open problem: which graphs have the zero as the largest eigenvalue of their modularity matrix? The conjecture was that only the complete and complete multipartite graphs. They indeed have this property, but are they the only ones? In this paper, we will give an affirmative answer to this question and prove a bit more: both the modularity and the normalized modularity matrix of a graph is negative semidefinite if and only if the graph is complete or complete multipartite.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

归一化模ularity矩阵的leading eigenvectors所定位的cluster的模ularity界值

Modularity bounds for clusters located by leading eigenvectors of the normalized modularity matrix

University of Udine（乌迪内大学）；Saarland University（萨尔兰大学）

本文基于归一化模ularity矩阵的leading eigenvector正项，研究其诱导子图的连通性，并推导出模ularity下界，证明高正特征值对应的nodal domains具有正模ularity，支持社区划分的理论基础。

2016-02-17cs.NAcs.SImath.NA

关于归一化拉普拉斯算子的第二大谱间隙从 $1$ 开始的 Cheeger 型不等式

Cheeger-type inequalities for the second largest spectral gap from $1$ of the normalized Laplacian

Vrije Universiteit Amsterdam（阿姆斯特丹自由大学）；University of Passau（帕绍大学）

研究图的归一化拉普拉斯算子第二大谱间隙，引入具有两步随机游走概率解释的新 Cheeger 型常数，并建立类似经典 Cheeger 不等式的尖锐不等式。

2026-06-06math.COmath.SP

谱的尽头：归一化拉普拉斯矩阵最大特征值的色数界

At the end of the spectrum: Chromatic bounds for the largest eigenvalue of the normalized Laplacian

本文研究归一化拉普拉斯矩阵最大特征值与着色数之间的色数界，刻画了达到下界 χ/(χ-1) 的图及其重数，并给出相关上界。

2024-07-04math.COmath.SP

Modularity spectra, eigen-subspaces, and structure of weighted graphs

The role of the normalized modularity matrix in finding homogeneous cuts will be presented. We also discuss the testability of the structural eigenvalues and that of the subspace spanned by the corresponding eigenvectors of this matrix. In the presence of a spectral gap between the k-1 largest absolute value eigenvalues and the remainder of the spectrum, this in turn implies the testability of the sum of the inner variances of the k clusters that are obtained by applying the k-means algorithm for the appropriately chosen vertex representatives.

2013-01-22math.SPmath.STstat.TH

Spectral gap of the largest eigenvalue of the normalized graph Laplacian

We offer a new method for proving that the maximal eigenvalue of the normalized graph Laplacian of a graph with $n$ vertices is at least $\frac{n+1}{n-1}$ provided the graph is not complete and that equality is attained if and only if the complement graph is a single edge or a complete bipartite graph with both parts of size $\frac{n-1}2$. With the same method, we also prove a new lower bound to the largest eigenvalue in terms of the minimum vertex degree, provided this is at most $\frac{n-1}{2}$.

2020-01-09math.SP

Cheeger-like inequalities for the largest eigenvalue of the graph Laplace Operator

We define a new Cheeger-like constant for graphs and we use it for proving Cheeger-like inequalities that bound the largest eigenvalue of the normalized Laplace operator.

2021-01-20math.COmath.SP

更多相关论文收起更多论文

花瓣图与书图：从1出发的最大拉普拉斯谱间隙

Petals and Books: The largest Laplacian spectral gap from 1

本文证明了连通图归一化拉普拉斯算子从1出发的谱间隙至多为1/2，并刻画了取等时图必为花瓣图或书图，从而给出最大间隙区间及邻域图特征值收敛速率的精确界。

2023-06-11math.COmath.SP

Minimum vertex covers and the spectrum of the normalized Laplacian on trees

We show that, in the graph spectrum of the normalized graph Laplacian on trees, the eigenvalue 1 and eigenvalues near 1 are strongly related to minimum vertex covers. In particular, for the eigenvalue 1, its multiplicity is related to the size of a minimum vertex cover, and zero entries of its eigenvectors correspond to vertices in minimum vertex covers; while for eigenvalues near 1, their distance to 1 can be estimated from minimum vertex covers; and for the largest eigenvalue smaller than 1, the sign graphs of its eigenvectors take vertices in a minimum vertex cover as representatives.

2012-05-05math.COmath.SP

Eigenvalue bounds for some classes of matrices associated with graphs

For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue inclusion sets. Using these bounds, first we derive bounds for the second largest and smallest eigenvalues of adjacency matrices of $k$-regular graphs. Then, we establish some bounds for the second largest and the smallest eigenvalues of the normalized adjacency matrices of graphs and the second smallest eigenvalue and the largest eigenvalue of the Laplacian matrices of graphs. Sharpness of these bounds are verified by examples.

2020-08-25math.COmath.SP

图的共形刚性：子微分与轨道等距性

Conformal Rigidity of Graphs: Subdifferentials and Orbit-Isometries

University of Washington（华盛顿大学）

本文通过子微分语言建立共形刚性新框架，结合变分视角与边等距谱嵌入几何，提出轨道等距嵌入概念，为广泛图类提供精确认证方法，解决共形刚性开放问题。

2026-05-14math.COmath.OCmath.SP

On Distribution of Laplacian Eigenvalues of Graphs

The work in this thesis concerns the investigation of eigenvalues of the Laplacian matrix, normalized Laplacian matrix, signless Laplacian matrix and distance signless Laplacian matrix of graphs. In Chapter 1, we present a brief introduction of spectral graph theory with some definitions. Chapter $2$ deals with the sum of $ k $ largest Laplacian eigenvalues $ S_{k}(G) $ of graph $ G $ and Brouwer's conjecture. We obtain the upper bounds for $ S_{k}(G) $ for some classes of graphs and use them to verify Brouwer's conjecture for these classes of graphs. Also, we prove Brouwer's conjecture for mo…

2021-07-19math.COmath.GRmath.RA