Results 71 to 80 of about 2,218,762 (336)
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
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
Asymptotic behavior of the number of Eulerian orientations of graphs
We consider the class of simple graphs with large algebraic connectivity (the second-smallest eigenvalue of the Laplacian matrix). For this class of graphs we determine the asymptotic behavior of the number of Eulerian orientations.
B. D. McKay, R. W. Robinson+5 more
core +3 more sources
Stimulated Raman Scattering with Optical Vortex Beams
This study presents exact analytical expressions for stimulated Raman scattering with Laguerre‐Gaussian beams, revealing signal dependence on topological and hyperbolic momentum. The results provide a theoretical foundation for coherent Raman imaging and detecting orbital angular momentum of light via structured light in nonlinear optics.
Minhaeng Cho
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
Laplacian versus Adjacency Matrix in Quantum Walk Search
A quantum particle evolving by Schr\"odinger's equation contains, from the kinetic energy of the particle, a term in its Hamiltonian proportional to Laplace's operator.
Nahimov, Nikolay+2 more
core +1 more source
Simplicial matrix-tree theorems [PDF]
We generalize the definition and enumeration of spanning trees from the setting of graphs to that of arbitrary-dimensional simplicial complexes $\Delta$, extending an idea due to G. Kalai.
Duval, Art M.+2 more
core +5 more sources
Utilizing a stereotaxic injection mouse model and a novel mathematical approach, this study uncovers key subnetworks that drive pathological α‐synuclein (α‐Syn) progression in Parkinson's disease (PD). Remarkably, just 2% of the strongest connections in the connectome are sufficient to predict its spread.
Yuanxi Li+16 more
wiley +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