Results 1 to 10 of about 34,618 (252)

Influence of Source Parameters and Non-Kolmogorov Turbulence on Evolution Properties of Radial Phased-Locked Partially Coherent Vortex Beam Array

open access: yesPhotonics, 2021
Partially coherent optical vortices have been applicated widely to reduce the influence of atmospheric turbulence, especially for free-space optical (FSO) communication.
Jiao Wang   +5 more
doaj   +1 more source

k路覆盖图的新充分条件(New sufficient conditions on k -path-coverable graphs)

open access: yesZhejiang Daxue xuebao. Lixue ban, 2019
Let G be a simple connected graph of order n. A graph G is k-path-coverable if its vertex set V ( G ) can be covered by kor fewer vertex-disjoint paths. In this paper, we give some new sufficient conditions for a graph to be k-path-coverable in terms of ...
JIAHuicai(贾会才)
doaj   +1 more source

New Z-Eigenvalue Localization Set for Tensor and Its Application in Entanglement of Multipartite Quantum States

open access: yesMathematics, 2022
This study focuses on tensor Z-eigenvalue localization and its application in the geometric measure of entanglement for multipartite quantum states. A new Z-eigenvalue localization theorem and the bounds for the Z-spectral radius are derived, which are ...
Liang Xiong   +3 more
doaj   +1 more source

On distance signless Laplacian spectrum and energy of graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2018
The distance signless Laplacian spectral radius of a connected graph G is the largest eigenvalue of the distance signless Laplacian matrix of G‎, ‎defined as ‎D‎Q(G) = Tr(G) + D(G)‎, ‎where D(G) is the distance matrix of G and Tr(G) is the diagonal ...
Abdollah Alhevaz   +2 more
doaj   +1 more source

The normalized distance Laplacian

open access: yesSpecial Matrices, 2021
The distance matrix 𝒟(G) of a connected graph G is the matrix containing the pairwise distances between vertices. The transmission of a vertex vi in G is the sum of the distances from vi to all other vertices and T(G) is the diagonal matrix of ...
Reinhart Carolyn
doaj   +1 more source

图的补距离矩阵谱半径的最大值(On maximal spectral radius of complementary distance matrix of graphs)

open access: yesZhejiang Daxue xuebao. Lixue ban, 2013
We determine the graphs with maximal spectral radius of the complementary distance matrix among simple connected graphs with fixed order and matching number and diameter less than or equal to 2.
SULi(苏莉), LIHong-hai(李红海)
doaj   +1 more source

Light field analysis for modeling and transmission characteristics of partially coherent light-emitting diodes

open access: yesFrontiers in Physics, 2023
When analyzing the transmission characteristics of LEDs for long-distance lighting and communication applications, the light field is commonly assumed to be fully incoherent. However, in reality, the LED light source emits partially coherent light with a
Zhifang Miao   +4 more
doaj   +1 more source

Spatial and Temporal Distribution of Northwest Cape Transmitter (19.8 kHz) Radio Signals Using Data Collected by the China Seismo-Electromagnetic Satellite

open access: yesAtmosphere, 2023
Very Low Frequency (VLF) waves radiated from ground-based transmitters are crucial for long-distance communication and underwater navigation. These waves can reflect between the Earth’s surface and the ionosphere for Earth–ionosphere waveguide ...
Honggeng Cai   +4 more
doaj   +1 more source

Inequalities for Distance Signless Laplacian Matrix Under Minimum-Degree Constraints

open access: yesJournal of Mathematics
For a connected graph G of order n, let DG denote its distance matrix and let TrG be the diagonal matrix formed by the vertex transmissions. The distance signless Laplacian of G is defined by DQ=DG+TrG.
Mohd Abrar Ul Haq, S. Pirzada, Y. Shang
doaj   +1 more source

Spectral and Sharp Sufficient Conditions for Graphs to Admit a Strong Star Factor

open access: yesMathematics
LetGbe a graph. An odd [1,k]-factor of a graph G is a spanning subgraph H of G such that degH(v) is odd and 1⩽degH(v)⩽k for every v∈V(G) where k is a positive odd integer. We call a spanning subgraph H of a graph G a strong star factor if every component
Fengyun Ren, Shumin Zhang, He Li
doaj   +1 more source

Home - About - Disclaimer - Privacy