中文
相关论文

相关论文: Generalized block diagonal Laplacian spectrum of g…

200 篇论文

The aim of the present paper is to analyse the spectrum of Laplace and Dirac type operators on metric graphs. In particular, we show for equilateral graphs how the spectrum (up to exceptional eigenvalues) can be described by a natural…

数学物理 · 物理学 2008-01-15 Olaf Post

In this paper, we investigate the spectrum of a class of weighted Laplacians on Cayley graphs and determine under what conditions the corresponding eigenspaces are generically irreducible. Specifically, we analyze the spectrum on…

Coalescing involves gluing one or more rooted graphs onto another graph. Under specific conditions, it is possible to start with cospectral graphs that are coalesced in similar ways that will result in new cospectral graphs. We present a…

We study the Laplacian spectrum of token graphs, also called symmetric powers of graphs. The $k$-token graph $F_k(G)$ of a graph $G$ is the graph whose vertices are the $k$-subsets of vertices from $G$, two of which being adjacent whenever…

In this paper, we investigate the spectral properties of the adjacency and the Laplacian matrices of random graphs. We prove that: (i) the law of large numbers for the spectral norms and the largest eigenvalues of the adjacency and the…

概率论 · 数学 2010-11-12 Xue Ding , Tiefeng Jiang

We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the…

量子物理 · 物理学 2007-05-23 David Emms , Edwin R. Hancock , Simone Severini , Richard C. Wilson

A matching M is a dominating induced matching of a graph, if every edge of the graph is either in $M$ or has a common end-vertex with exactly one edge in $M$. The concept of complete dominating induced matching is introduced as graphs where…

组合数学 · 数学 2013-11-13 Domingos M. Cardoso , Enide A. Martins , Luís Medina , Oscar Rojo

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

The problem of characterizing graphs by their generalized spectra has received significant attention in recent years. This paper provides a complete proof of a conjecture proposed by Wang, Wang, and Zhu (European J. Combin., 2023), which…

组合数学 · 数学 2026-05-07 Wei Wang , Quanyu Tang , Wei Wang

It is reported that dynamical systems over digraphs have superior performance in terms of system damping and tolerance to time delays if the underlying graph Laplacian has a purely real spectrum. This paper investigates the topological…

最优化与控制 · 数学 2025-08-08 Tianhao Yu , Shenglu Wang , Mengqi Xue , Yue Song , David J. Hill

Given a graph $A$ on a group $G$ and an equivalence relation $B$ on $G$, the $B$ super$A$ graph, whose vertex set is $G$ and two vertices $g$, $h$ are adjacent if and only if there exist $g^{\prime} \in[g]$ and $h^{\prime} \in[h]$ such that…

组合数学 · 数学 2024-11-27 Varun J Kaushik , Ekta , Parveen , Jitender Kumar

Given a regular (connected) graph $\Gamma=(X,E)$ with adjacency matrix $A$, $d+1$ distinct eigenvalues, and diameter $D$, we give a characterization of when its distance matrix $A_D$ is a polynomial in $A$, in terms of the adjacency…

组合数学 · 数学 2019-06-05 M. A. Fiol , Safet Penjić

We consider Laplacians on $\Z^2$-periodic discrete graphs. The following results are obtained: 1) The Floquet-Bloch decomposition is constructed and basic properties are derived. 2) The estimates of the Lebesgue measure of the spectrum in…

谱理论 · 数学 2013-01-30 Andrey Badanin , Evgeny Korotyaev , Natalia Saburova

Arrangement graphs were introduced for their connection to computational networks and have since generated considerable interest in the literature. In a pair of recent articles by Chen, Ghorbani and Wong, the eigenvalues for the adjacency…

表示论 · 数学 2017-08-16 José Araujo , Tim Bratten

The Helmholtzian matrix of a graph $G=(V(G),E(G))$ is a graph-theoretic analogue of the vector Laplacian (or Helmholtz operator) [S. Li, L. Lu, J.F. Wang, A graph discretization of vector Laplacian, 379 (2026) 446--460]. Motivated by the…

组合数学 · 数学 2026-05-06 Lu Lu , Yongtang Shi , Zoran Stanić , Jianfeng Wang , Yi Wang

For a simple graph $G$, the generalized adjacency matrix $A_{\alpha}(G)$ is defined as $A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G), \alpha\in [0,1]$, where $A(G)$ is the adjacency matrix and $D(G)$ is the diagonal matrix of vertex degrees of…

组合数学 · 数学 2021-10-26 Bilal A. Rather , Hilal A. Ganie , S. Pirzada

Very recently Ma and Wu \cite{wu2024generalization} obtained a generalization of Fielder's lemma and applied to find adjacency, Laplacian, and signless Laplacian spectra of $P_n-$ product of commuting graphs. In this paper, we give a…

组合数学 · 数学 2024-10-01 Komal Kumari , Pratima Panigrahi

In this paper, we prove sharp $\ell^2$ decay estimates of nonnegative generalized subharmonic functions on graphs with positive Laplacian spectrum, which extends the result by Li and Wang on Riemannian manifolds.

微分几何 · 数学 2021-09-09 Bobo Hua , Zhiqin Lu

The power graph $\mathscr{P}(G)$ of a group $G$ is an undirected graph with all the elements of $G$ as vertices and where any two vertices $u$ and $v$ are adjacent if and only if $u=v^m $ or $v=u^m$, $ m \in$ $\mathbb{Z}$. For a simple…

组合数学 · 数学 2023-07-19 Komal Kumari , Pratima Panigrahi

We study the symmetry properties of the spectra of normalized Laplacians on signed graphs. We find a new machinery that generates symmetric spectra for signed graphs, which includes bipartiteness of unsigned graphs as a special case.…

组合数学 · 数学 2016-02-16 Fatihcan M. Atay , Bobo Hua