Results 41 to 50 of about 121,870 (266)
The Distance Laplacian Spectral Radius of Clique Trees
Discrete Dynamics in Nature and Society, 2020 The distance Laplacian matrix of a connected graph G is defined as ℒG=TrG−DG, where DG is the distance matrix of G and TrG is the diagonal matrix of vertex transmissions of G.
Xiaoling Zhang, Jiajia Zhou
doaj +1 more source
On Eccentricity Version of Laplacian Energy of a Graph [PDF]
Mathematics Interdisciplinary Research, 2017 The energy of a graph G is equal to the sum of absolute values of the eigenvalues of the adjacency matrix of G, whereas the Laplacian energy of a graph G is equal to the sum of the absolute value of the difference between the eigenvalues of the Laplacian
Nilanjan De
doaj +1 more source
A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials
AKCE International Journal of Graphs and Combinatorics, 2023 The permanent of an n × n matrix [Formula: see text] is defined as [Formula: see text] where the sum is taken over all permutations σ of [Formula: see text] The permanental polynomial of M, denoted by [Formula: see text] is [Formula: see text] where In ...
Aqib Khan +2 more
doaj +1 more source
On the Adjacency, Laplacian, and Signless Laplacian Spectrum of Coalescence of Complete Graphs
Journal of Mathematics, 2016 Coalescence as one of the operations on a pair of graphs is significant due to its simple form of chromatic polynomial. The adjacency matrix, Laplacian matrix, and signless Laplacian matrix are common matrices usually considered for discussion under ...
S. R. Jog, Raju Kotambari
doaj +1 more source
Approximate Gaussian Elimination for Laplacians: Fast, Sparse, and Simple
, 2016 We show how to perform sparse approximate Gaussian elimination for Laplacian matrices. We present a simple, nearly linear time algorithm that approximates a Laplacian by a matrix with a sparse Cholesky factorization, the version of Gaussian elimination ...
Kyng, Rasmus, Sachdeva, Sushant
core +1 more source
On Minimum Algebraic Connectivity of Tricyclic Graphs [PDF]
Mathematics Interdisciplinary ResearchConsider a simple, undirected graph $ G=(V,E)$, where $A$ represents the adjacency matrix and $Q$ represents the Laplacian matrix of $G$. The second smallest eigenvalue of Laplacian matrix of $G$ is called the algebraic connectivity of $G$.
Hassan Taheri, Gholam Hossein Fath-Tabar
doaj +1 more source
MathematicsFor network graphs, numerous graph features are intimately linked to eigenvalues of the Laplacian matrix, such as connectivity and diameter. Thus, it is very important to solve eigenvalues of the Laplacian matrix for graphs.
Changlei Zhan, Xiangyu Li, Jie Chen
doaj +1 more source
Random walks with long-range steps generated by functions of Laplacian matrices
, 2018 In this paper, we explore different Markovian random walk strategies on networks with transition probabilities between nodes defined in terms of functions of the Laplacian matrix.
Collet, B. A. +4 more
core +1 more source
Hydrogen‐Bond–Driven Ion Retention in Electrolyte‐Gated Synaptic Transistors
Advanced Functional Materials, EarlyView.Anion molecular design governs ion–polymer interactions in electrolyte‐gated synaptic transistors. Asymmetric anions induce hydrogen‐bond interactions that suppress ion back‐diffusion and stabilize doping, enabling enhanced nonvolatile synaptic properties.
Donghwa Lee +5 more
wiley +1 more source
Signless Laplacian determinations of some graphs with independent edges
Karpatsʹkì Matematičnì Publìkacìï, 2018 Let $G$ be a simple undirected graph. Then the signless Laplacian matrix of $G$ is defined as $D_G + A_G$ in which $D_G$ and $A_G$ denote the degree matrix and the adjacency matrix of $G$, respectively.
R. Sharafdini, A.Z. Abdian
doaj +1 more source