Results 51 to 60 of about 121,348 (314)
On the Adjacency, Laplacian, and Signless Laplacian Spectrum of Coalescence of Complete Graphs
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
The Distance Laplacian Spectral Radius of Clique Trees
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 Minimum Algebraic Connectivity of Tricyclic Graphs [PDF]
Consider 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
On Eccentricity Version of Laplacian Energy of a Graph [PDF]
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
For 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
Nonlocal Conduction in a Metawire
A 1D metawire composed of twisted copper wires is designed and realized. This metamaterial exhibits pronounced effects of nonlocal electric conduction according to Ohm's law. The current at one location not only depends on the electric field at that location but also on other locations.
Julio Andrés Iglesias Martínez +3 more
wiley +1 more source
Signless Laplacian determinations of some graphs with independent edges
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
A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials
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
Embedded flexible sensing technologies advance underwater soft robotics, yet most systems still suffer from hysteresis and limited perceptiveness. Instead, vision‐based tactile sensors provide reliable and rapid feedback essential for complex underwater tasks.
Qiyi Zhang +5 more
wiley +1 more source
Laplacian integral signed graphs with few cycles
A connected graph with n vertices and m edges is called k-cyclic graph if k=m−n+1. We call a signed graph is Laplacian integral if all eigenvalues of its Laplacian matrix are integers.
Dijian Wang, Dongdong Gao
doaj +1 more source

