Results 41 to 50 of about 1,705,971 (292)

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   +2 more sources

On Eccentricity Version of Laplacian Energy of a Graph [PDF]

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

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

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

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

On the Eigenvalues of General Sum-Connectivity Laplacian Matrix [PDF]

open access: yesJournal of the Operations Research Society of China, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deng, Hanyuan, Huang, He, Zhang, Jie
openaire   +3 more sources

The Laplacian spectral radius of graphs [PDF]

open access: yes, 2010
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplacian matrix. In this paper, we improve Shi's upper bound for the Laplacian spectral radius of irregular graphs and present some new bounds for the Laplacian
Jianxi Li   +5 more
core   +1 more source

Discrete 2D Material Programming for 3D Shaping and Morphogenesis‐Inspired 4D Bioprinting

open access: yesAdvanced Science, EarlyView.
Cell‐compatible discrete 2D material programming enables 2‐to‐3D shape transformation and morphogenesis‐inspired 4D bioprinting. By patterning cell‐supportive microdomains within a responsive hydrogel, the approach programs in‐plane growth to encode target metrics.
Fereshteh Family   +3 more
wiley   +1 more source

Considering spatiotemporal evolutionary information in dynamic multi‐objective optimisation

open access: yesCAAI Transactions on Intelligence Technology, EarlyView., 2023
Abstract Preserving population diversity and providing knowledge, which are two core tasks in the dynamic multi‐objective optimisation (DMO), are challenging since the sampling space is time‐ and space‐varying. Therefore, the spatiotemporal property of evolutionary information needs to be considered in the DMO.
Qinqin Fan   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy