中文
相关论文

相关论文: The largest Laplacian eigenvalue and the balancedn…

200 篇论文

In this paper, we investigate the Dirichlet problem of Laplacian on complete Riemannian manifolds. By constructing new trial functions, we obtain a sharp upper bound of the gap of the consecutive eigenvalues in the sense of the order, which…

微分几何 · 数学 2016-12-21 Lingzhong Zeng

For every real $0\leq \alpha \leq 1$, Nikiforov defined the $A_{\alpha}$-matrix of a graph $G$ as $A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G)$, where $A(G)$ and $D(G)$ are the adjacency matrix and the degree diagonal matrix of a graph $G$,…

组合数学 · 数学 2020-12-22 Zhen Lin , Lianying Miao , Shuguang Guo

A complex unit gain graph ($\mathbb{T}$-gain graph), $\Phi = (G, \varphi)$ is a graph where the function $\varphi$ assigns a unit complex number to each orientation of an edge of $G$, and its inverse is assigned to the opposite orientation.…

组合数学 · 数学 2021-05-11 M. Rajesh Kannan , Navish Kumar , Shivaramakrishna Pragada

In this paper, structural properties of chordal graphs are analysed, in order to establish a relationship between these structures and integer Laplacian eigenvalues. We present the characterization of chordal graphs with equal vertex and…

离散数学 · 计算机科学 2019-07-12 Nair Maria Maia de Abreu , Claudia Marcela Justel , Lilian Markenzon

Let $G$ be a simple graph with $n$ vertices and $m$ edges and let $k$ be a natural number such that $k\leq n.$ Brouwer conjectured that the sum of the $k$ largest Laplacian eigenvalues of $G$ is at most $m+{k+1 \choose 2}.$ In this paper we…

组合数学 · 数学 2024-12-18 Slobodan Filipovski

In [Ho] A.J. Hoffman proved a lower bound on the chromatic number of a graph in the terms of the largest and the smallest eigenvalues of its adjacency matrix. In this paper, we prove a higher dimensional version of this result and give a…

组合数学 · 数学 2019-06-03 Konstantin Golubev

Given a connected graph $G$, the Randi\'c index $R(G)$ is the sum of $\tfrac{1}{\sqrt{d(u)d(v)}}$ over all edges $\{u,v\}$ of $G$, where $d(u)$ and $d(v)$ are the degree of vertices $u$ and $v$ respectively. Let $q(G)$ be the largest…

组合数学 · 数学 2018-12-04 Bo Ning , Xing Peng

For a graph $G$, let $S_2(G)$ be the sum of the first two largest signless Laplacian eigenvalues of $G$, and $f(G)=e(G)+3-S_2(G)$. Oliveira, Lima, Rama and Carvalho conjectured that $K^+_{1,n-1}$ (the star graph with an additional edge) is…

组合数学 · 数学 2024-06-14 Zi-Ming Zhou , Chang-Xiang He , Hai-Ying Shan

The sum of the first $n \geq 1$ eigenvalues of the Laplacian is shown to be maximal among triangles for the equilateral triangle, maximal among parallelograms for the square, and maximal among ellipses for the disk, provided the ratio…

谱理论 · 数学 2010-09-28 R. S. Laugesen , B. A. Siudeja

Let $G$ be a simple graph with adjacency matrix $A(G)$, signless Laplacian matrix $Q(G)$, degree diagonal matrix $D(G)$ and let $l(G)$ be the line graph of $G$. In 2017, Nikiforov defined the $A_\alpha$-matrix of $G$, $A_\alpha(G)$, as a…

The signless Laplacian spectral radius of a graph $G$, denoted by $q(G)$, is the largest eigenvalue of its signless Laplacian matrix. In this paper, we investigate extremal signless Laplacian spectral radius for graphs without short cycles…

组合数学 · 数学 2023-05-08 Wenwen Chen , Bing Wang , Mingqing Zhai

We discuss Laplacian spectrum on a finite metric graph with vertex couplings violating the time-reversal invariance. For the class of star graphs we determine, under the condition of a fixed total edge length, the configurations for which…

数学物理 · 物理学 2025-03-14 Pavel Exner , Jonathan Rohleder

Let $G$ be a simple graph. A pendant path of $G$ is a path such that one of its end vertices has degree $1$, the other end has degree $\ge3$, and all the internal vertices have degree $2$. Let $p_k(G)$ be the number of pendant paths of…

组合数学 · 数学 2016-04-08 Ebrahim Ghorbani

Let G and H be equivalent cographs with their reduction R_G and R_H, and suppose the vertices of R_G and R_H are labeled by the twin numbers t_i of the k twin classes they represent. In this paper, we prove that G and H have at least k +…

组合数学 · 数学 2021-08-12 J. Lazzarin , O. F. Márquez , F. C. Tura

For a graph $G$ and a non-zero real number $\alpha$, the graph invariant $S_{\alpha}(G)$ is the sum of the $\alpha^{th}$ power of the non-zero signless Laplacian eigenvalues of $G$. In this paper, we obtain the sharp bounds of…

组合数学 · 数学 2013-06-07 Lihua You , Jieshan Yang

Let $u$ be an eigenfunction of the Laplacian on a compact manifold with boundary, with Dirichlet or Neumann boundary conditions, and let $-\lambda^2$ be the corresponding eigenvalue. We consider the problem of estimating the maximum of $u$…

谱理论 · 数学 2007-05-23 D. Grieser

Let G be a graph of order n and let q(G) be that largest eigenvalue of the signless Laplacian of G. In this note it is shown that if k>1 and q(G)>=n+2k-2, then G contains cycles of length l whenever 2<l<2k+3. This bound is asymptotically…

组合数学 · 数学 2014-02-26 V. Nikiforov

Let $M$ be a compact connected manifold of dimension $n$ endowed with a conformal class $C$ of Riemannian metrics of volume one. For any integer $k\geq0$, we consider the conformal invariant $\lambda_k ^c (C)$ defined as the supremum of the…

微分几何 · 数学 2007-05-23 Bruno Colbois , Ahmad El Soufi

In this paper, we completely classify the connected non-bipartite graphs with integral signless Laplacian eigenvalues at most 6.

组合数学 · 数学 2025-03-20 Semin Oh , Jeong Rye Park , Jongyook Park , Yoshio Sano

Let $G$ be a graph with $p(G)$ pendant vertices and $q(G)$ quasi-pendant vertices. Denote by $m_{L(G)}(\lambda)$ the multiplicity of $\lambda$ as a Laplacian eigenvalue of $G$. Let $\overline{G}$ be the reduced graph of $G$, which can be…

组合数学 · 数学 2025-07-09 Fenglei Tian , Dein Wong