相关论文: More on the normalized Laplacian Estrada index

The General Randi\'c index $R_\alpha$ of a simple graph $G$ is defined as \[ R_\alpha(G)=\sum_{v_{i}\sim v_{j}} (\delta_{i}\delta_{j})^\alpha, \] where $\delta_i$ denotes the degree of the vertex $v_i$. Rodr\'iguez-Vel\'azquez and…

Let $\mathcal A$ be the adjacency matrix of a random $d$-regular graph on $N$ vertices, and we denote its eigenvalues by $\lambda_1\geq \lambda_2\cdots \geq \lambda_{N}$. For $N^{2/3}\ll d\leq N/2$, we prove optimal rigidity estimates of…

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…

The independence complex of a graph $G=(V,E)$ is the simplicial complex $I(G)$ on vertex set $V$ whose simplices are the independent sets in $G$. We present new lower bounds on the eigenvalues of the $k$-dimensional Laplacian $L_k(I(G))$ in…

Let $G$ be a molecular graph. The total-eccentricity index of graph $G$ is defined as the sum of eccentricities of all vertices of $G$. %In [R. Farooq, M.A. Malik, J. Rada, Extremal graphs with respect to total-eccentricity index, 2017,…

The edge-Wiener index $W_e(G)$ of a connected graph $G$ is the sum of distances between all pairs of edges of $G$. A connected graph $G$ is said to be a cactus if each of its blocks is either a cycle or an edge. Let $\mathcal{G}_{n,t}$…

The incidence energy $\mathscr{IE}(G)$ of a graph $G$, defined as the sum of the singular values of the incidence matrix of a graph $G$, is a much studied quantity with well known applications in chemical physics. The Laplacian-energy-like…

Learning a graph with a specific structure is essential for interpretability and identification of the relationships among data. It is well known that structured graph learning from observed samples is an NP-hard combinatorial problem. In…

Let $A(G)$ and $D(G)$ be the adjacency matrix and the degree diagonal matrix of a graph $G$, respectively. Then $L(G)=D(G)-A(G)$ is called Laplacian matrix of the graph $G$. Let $G$ be a graph with $n$ vertices and $m$ edges. Then the…

The fractional stable set polytope ${\rm FRAC}(G)$ of a simple graph $G$ with $d$ vertices is a rational polytope that is the set of nonnegative vectors $(x_1,\ldots,x_d)$ satisfying $x_i+x_j\le 1$ for every edge $(i,j)$ of $G$. In this…

The toughness $t(G)$ of a graph $G=(V,E)$ is defined as $t(G)=\min\{\frac{|S|}{c(G-S)}\}$, in which the minimum is taken over all $S\subset V$ such that $G-S$ is disconnected, where $c(G-S)$ denotes the number of components of $G-S$. We…

Let $G=(V, E)$ be a simple graph with vertex set $V$ and edge set $E$. The Sombor index of the graph $G$ is a degree-based topological index, defined as $$SO(G)=\sum_{uv \in E}\sqrt{d(u)^2+d(v)^2},$$ in which $d(x)$ is the degree of the…

In this paper we study the Spanning Tree Congestion problem, where we are given a graph $G=(V,E)$ and are asked to find a spanning tree $T$ of minimum maximum congestion. Here, the congestion of an edge $e\in T$ is the number of edges…

We provide upper and lower bounds on the smallest eigenvalue of grounded Laplacian matrices (which are matrices obtained by removing certain rows and columns of the Laplacian matrix of a given graph). The gap between the upper and lower…

Gutman {\it et al.} introduced the concepts of energy $\En(G)$ and Laplacian energy $\EnL(G)$ for a simple graph $G$, and furthermore, they proposed a conjecture that for every graph $G$, $\En(G)$ is not more than $\EnL(G)$. Unfortunately,…

Focusing on coupling between edges, we generalize the relationship between the normalized graph Laplacian and random walks on graphs by devising an appropriate normalization for the Hodge Laplacian -- the generalization of the graph…

We show that the (normalized) symmetric Laplacian of a simple graph can be obtained from the partial trace over a pure bipartite quantum state that resides in a bipartite Hilbert space (one part corresponding to the vertices, the other…

For a given graph $G$, we aim to determine the possible realizable spectra for a generalized (or sometimes referred to as a weighted) Laplacian matrix associated with $G$. This new specialized inverse eigenvalue problem is considered for…

Let $F(G)$ be the number of spanning forests in a graph $G$ and $\mathcal{C}(n,d)$ be the set of all connected $d$-regular simple graphs of order $n$. Define $\widehat{f}_{d}=\liminf_{n\rightarrow \infty}\{F(G)^{1/n}:G\in…

Sequences of certain finite graphs, antitrees, are constructed along which the Anderson model shows GOE statistics, i.e. a re-scaled eigenvalue process converges to the ${\rm Sine}_1$ process. The Anderson model on the graph is a random…