Results 111 to 120 of about 2,218,762 (336)
On Path Laplacian Eigenvalues and Path Laplacian Energy of Graphs
We introduce the concept of Path Laplacian Matrix for a graph and explore the eigenvalues of this matrix. The eigenvalues of this matrix are called the path Laplacian eigenvalues of the graph.
Shridhar Chandrakant Patekar+1 more
doaj
On the Eigenvalues of General Sum-Connectivity Laplacian Matrix [PDF]
The connectivity index was introduced by Randic (J. Am. Chem. Soc. 97(23):6609–6615, 1975) and was generalized by Bollobas and Erdos (Ars Comb. 50:225–233, 1998). It studies the branching property of graphs, and has been applied to studying network structures.
Deng, Hanyuan, Huang, He, Zhang, Jie
openaire +3 more sources
Abstract Let (Mn,g)$(M^n,g)$ be a complete Riemannian manifold which is not isometric to Rn$\mathbb {R}^n$, has nonnegative Ricci curvature, Euclidean volume growth, and quadratic Riemann curvature decay. We prove that there exists a set G⊂(0,∞)$\mathcal {G}\subset (0,\infty)$ with density 1 at infinity such that for every V∈G$V\in \mathcal {G}$ there ...
Gioacchino Antonelli+2 more
wiley +1 more source
Laplacian spectral characterization of roses
A rose graph is a graph consisting of cycles that all meet in one vertex. We show that except for two specific examples, these rose graphs are determined by the Laplacian spectrum, thus proving a conjecture posed by Lui and Huang [F.J. Liu and Q.X. Huang,
Belardo+15 more
core +2 more sources
The p-spectral radius of the Laplacian matrix
The p-spectral radius of a graph G=(V,E) with adjacency matrix A is defined as ?(p)(G) = max||x||p=1 xT Ax. This parameter shows connections with graph invariants, and has been used to generalize some extremal problems. In this work, we define the p-spectral radius of the Laplacian matrix L as ?(p)(G) = max||x||p=1 xT Lx.
Eliseu Fritscher+3 more
openaire +3 more sources
Group inverse matrix of the normalized Laplacian on subdivision networks
In this paper we consider a subdivision of a given network and we show how the group inverse matrix of the normalized laplacian of the subdivision network is related to the group inverse matrix of the normalized laplacian of the initial given network.
Carmona Mejías, Ángeles+2 more
openaire +6 more sources
Abstract We analyse and clarify the finite‐size scaling of the weakly‐coupled hierarchical n$n$‐component |φ|4$|\varphi |^4$ model for all integers n≥1$n \ge 1$ in all dimensions d≥4$d\ge 4$, for both free and periodic boundary conditions. For d>4$d>4$, we prove that for a volume of size Rd$R^{d}$ with periodic boundary conditions the infinite‐volume ...
Emmanuel Michta+2 more
wiley +1 more source
Laplacian and signless laplacian spectra and energies of multi-step wheels
Energies and spectrum of graphs associated to different linear operators play a significant role in molecular chemistry, polymerisation, pharmacy, computer networking and communication systems.
Zheng-Qing Chu+4 more
doaj +1 more source
Dual Laplacian regularized matrix completion for microRNA-disease associations prediction
Since lots of miRNA-disease associations have been verified, it is meaningful to discover more miRNA-disease associations for serving disease diagnosis and prevention of human complex diseases.
Chang Tang+4 more
semanticscholar +1 more source
Abstract We consider a planar Coulomb gas ensemble of size N$N$ with the inverse temperature β=2$\beta =2$ and external potential Q(z)=|z|2−2clog|z−a|$Q(z)=|z|^2-2c \log |z-a|$, where c>0$c>0$ and a∈C$a \in \mathbb {C}$. Equivalently, this model can be realised as N$N$ eigenvalues of the complex Ginibre matrix of size (c+1)N×(c+1)N$(c+1) N \times (c+1)
Sung‐Soo Byun+2 more
wiley +1 more source