Results 51 to 60 of about 1,624,240 (288)
On the Eigenvalues of General Sum-Connectivity Laplacian Matrix [PDF]
Journal 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
Two‐Dimensional Isotropic Spatial Differentiation Through Complete Polarization Control
Advanced Optical Materials, EarlyView.This work enables two‐dimensional isotropic spatial differentiation at planar interfaces over a wide range of incident angles by extending the output polarization from linear to elliptical. The choice of incident angle can be used to balance broader spectral response at low angles and higher edge‐detection efficiency at larger angles.
Doyoon Lee, Minkyung Kim
wiley +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
The Laplacian spread of graphs [PDF]
, 2009 summary:The Laplacian spread of a graph is defined as the difference between the largest and second smallest eigenvalues of the Laplacian matrix of the graph. In this paper, bounds are obtained for the Laplacian spread of graphs. By the Laplacian spread,
Tan, Ying-Ying +4 more
core +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
Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
, 2010 For every integer n≥4, it is proved that there is a unique graph of order n which maximizes the spectral radius of the unoriented Laplacian matrix over all bicyclic graphs of order n, namely, the graph obtained from the cycle C 4 by first adding a chord ...
Fan, Yi-zheng; 譚必信; Tam, Bit-shun; Zhou, Jun
core +1 more source
Advanced Science, EarlyView.B cells can be activated independently of antigen recognition via mechanical stimulation through nanoporous substrates. Exposure to such substrates induced B cell microvilli extension into the pores, intracellular Ca2+ signaling, phosphorylation of signaling proteins, and CD69 expression.
Nozie D. Aghaizu +4 more
wiley +1 more source
Discrete 2D Material Programming for 3D Shaping and Morphogenesis‐Inspired 4D Bioprinting
Advanced 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
Forest matrices around the Laplacian matrix [PDF]
, 2002 We study the matrices Qk of in-forests of a weighted digraph Γ and their connections with the Laplacian matrix L of Γ. The (i,j) entry of Qk is the total weight of spanning converging forests (in-forests) with k arcs such that i belongs to a tree rooted ...
Rafig Agaev +3 more
core +1 more source
A Unifying Approach to Self‐Organizing Systems Interacting via Conservation Laws
Advanced Intelligent Discovery, EarlyView.The article develops a unified way to model and analyze self‐organizing systems whose interactions are constrained by conservation laws. It represents physical/biological/engineered networks as graphs and builds projection operators (from incidence/cycle structure) that enforce those constraints and decompose network variables into constrained versus ...
F. Barrows +7 more
wiley +1 more source