Results 51 to 60 of about 18,314 (299)

Estimate Laplacian Spectral Properties of Large-Scale Networks by Random Walks and Graph Transformation

open access: yesMathematics
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

The Distance Laplacian Spectral Radius of Clique Trees

open access: yesDiscrete 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

SOME INEQUALITIES FOR THE GRAPH ENERGY OF DISTANCE LAPLACIAN MATRIX [PDF]

open access: yes, 2022
In this paper, the distance laplacian energy for distance matrix is examined. Some bounds for the laplacian eigenvalues of distance matrix are expanded including the distances, the vertices and the edges.
GÖK, GÜLİSTAN KAYA
core  

Mechanically Mutable Matrices: A Hierarchical Investigation of Decellularized Sea Cucumber Collagen as an Adaptable Scaffold Material

open access: yesAdvanced Functional Materials, EarlyView.
Sea cucumber mutable collagenous tissue (MCT) is a remarkable collagen‐based material which can rapidly undergo large changes in stiffness through transiently bound effector proteins. Here, we investigate the hierarchical structure and mechanical response of MCT from Cucumaria frondosa across length scales with a wide range of methods, also exploring ...
Nathalie R. H. Singh   +7 more
wiley   +1 more source

On Minimum Algebraic Connectivity of Tricyclic Graphs [PDF]

open access: yesMathematics Interdisciplinary Research
‎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

A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials

open access: yesAKCE 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

Flexible Dielectric Acoustic Resonator Patch for Tissue Regeneration

open access: yesAdvanced Materials, EarlyView.
A flexible dielectric acoustic resonator patch enables MHz‐range ultrasound generation through resonance amplification without using piezoelectric materials. Conformal integration on a curved substrate allows efficient acoustic delivery to tissue‐mimicking environments.
Donyoung Kang   +7 more
wiley   +1 more source

Convolution operators and the discrete Laplacian [PDF]

open access: yes, 2009
PhDIn this thesis, we obtain new results for convolution operators on homogeneous spaces and give applications to the Laplacian on a homogeneous graph. Some of these results have been published in joint papers [13, 14] with my supervisor.
Chen, Chung-Chuan
core  

Organic Materials of Tomorrow: Horizons of Artificial Intelligence

open access: yesAdvanced Materials, EarlyView.
This review examines machine learning techniques accelerating the discovery of organic semiconductors by linking molecular structure to properties. Key methods include graph neural networks, generative models, and active learning. Applications to organic photovoltaics demonstrate practical impact.
Harold Mena   +3 more
wiley   +1 more source

Signless Laplacian determinations of some graphs with independent edges

open access: yesKarpatsʹ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

Home - About - Disclaimer - Privacy