Results 81 to 90 of about 33,403 (178)
A commutative noncommutative fractal geometry
In this thesis examples of spectral triples, which represent fractal sets, are examined and new insights into their noncommutative geometries are obtained.
Samuel, Tony; id_orcid, Samuel, Anthony
core +1 more source
Accretion Geometry of the New Galactic Black Hole Candidate AT2019wey in the Hard State
We perform broadband spectral and timing studies of the Galactic low-mass black hole candidate AT2019wey using quasi-simultaneous NICER, Swift, and NuSTAR observations obtained in 2022.
Pragati Sahu +5 more
doaj +1 more source
The \emph{distance matrix} of a simple connected graph $G$ is $D(G)=(d_{ij})$, where $d_{ij}$ is the distance between the $i$th and $j$th vertices of $G$. The \emph{distance signless Laplacian matrix} of the graph $G$ is $D_Q(G)=D(G)+Tr(G)$, where $Tr(G)$
Panigrahi, Pratima, Atik, Fouzul
core +1 more source
There is a strong demand for buried sensor networks in industries including mining, agriculture, geothermal energy, and oil/gas. However, the integration of these sensors is bottle-necked by the need for electric power which cannot be delivered by ...
Olivia E. Nnadi +4 more
doaj +1 more source
Let D(G) be the distance matrix of a strongly connected digraph G, Tr(G) be the diagonal matrix with vertex transmissions of G as diagonal entries. The generalized distance matrix Dβ(G) of the strongly connected digraph G is defined as Dβ(G) = βTr(G)+(1 ...
Zengzhao Xu, Weige Xi
core +1 more source
We propose a novel Schell model source for generating twisted partially coherent beams with an initial radius of curvature, which is called a twisted flat-topped cosine Gaussian Schell-model (TFCGSM) source.
Shaohua Zhang +3 more
doaj +1 more source
The interaction of light with micro-scale dielectric structures has garnered significant attention in recent years due to its potential applications in various fields ranging from photonics to biomedical imaging.
Shadi A. Alboon +2 more
doaj +1 more source
Distance spectral conditions for $ID$-factor-critical and fractional $[a, b]$-factor of graphs
Let $G=(V(G), E(G))$ be a graph with vertex set $V(G)$ and edge set $E(G)$. A graph is $ID$-factor-critical if for every independent set $I$ of $G$ whose size has the same parity as $|V(G)|$, $G-I$ has a perfect matching.
Wang, Ligong, Ma, Tingyan
core
Survey strategies for upcoming exoplanet direct imaging missions have considered varying assumptions of prior knowledge. Precursor radial velocity surveys could have detected nearby exo-Earths and provided prior orbit and mass constraints. Alternatively,
Arnaud Salvador +3 more
doaj +1 more source
On the distance spectral radius, fractional matching and factors of graphs with given minimum degree
A fractional matching of G is a function f : E(G) → [0, 1] such that ∑e∈EG(vi) f(e) ≤ 1 for any vi ∈ V (G), where EG(vi) = {e : e ∈ E(G) and e is incident with vi}.
Zengzhao Xu, Ligong Wang, Weige Xi
core +1 more source

