Coronal Mass Ejections ( CMEs ) are challenging objects to detect using automated techniques, due to their high velocity and diffuse, irregular morphology. A necessary step to automating the detection process is to first remove the subjectivity introduced by the observer used in the current, standard, CME detection and tracking method. Here we describe and demonstrate a multiscale edge detectio...

The corona product G ◦ H of two graphs G and H is obtained by taking one copy of G and |V (G)| copies of H; and by joining each vertex of the i-th copy of H to the i-th vertex of G, where 1 ≤ i ≤ |V (G)|. In this paper, exact formulas for the eccentric distance sum and the edge revised Szeged indices of the corona product of graphs are presented. We also study the conditions under which the cor...

A deep Chandra observation of NGC 1265 (3C 83.1B), the prototype for the narrow-angled-tailed (NAT) radio galaxy, reveals a small cool X-ray thermal corona (∼ 0.6 keV) embedded in the hot ICM of the Perseus cluster (∼ 6.7 keV). The corona is asymmetric with a sharp edge (∼2.2, or 0.8 kpc from the nucleus) to the south and an extension to the north (at least ∼ 8 from the nucleus), which is inter...

In this paper, we compute the formulae for the third Zagreb indices and its coindices for two classes of graphs such as edge corona product graph, double graph and kth iterated double graph.

Using computer simulations we study how a corona of polymer molecules grafted to cellulose nanocrystal aggregate (CNA) particles influences the interaction between pairs of parallel CNAs. The resulting distance and orientation (face-to-face versus edge-to-edge) dependence is very rich and counterintuitive. Although the unperturbed polymer corona assumes cylindrical symmetry relatively quickly a...

In this paper we survey the behavior of various graph operations on the graph parameters clique-width and NLC-width. We give upper and lower bounds for the clique-width and NLC-width of the modi ed graphs in terms of the clique-width and NLC-width of the involved graphs. Therefor we consider the binary graph operations join, co-join, sum, di erence, products, corona, substitution, and 1-sum, an...

We extended the disk corona model (Meyer & Meyer-Hofmeister 1994; Meyer, Liu, & MeyerHofmeister 2000a) to the inner region of galactic nuclei by including different temperatures in ions and electrons as well as Compton cooling. We found that the mass evaporation rate and hence the fraction of accretion energy released in the corona depend strongly on the rate of incoming mass flow from outer ed...

An exponential dominating set of graph $G = (V,E )$ is a subset $Ssubseteq V(G)$ such that $sum_{uin S}(1/2)^{overline{d}{(u,v)-1}}geq 1$ for every vertex $v$ in $V(G)-S$, where $overline{d}(u,v)$ is the distance between vertices $u in S$ and $v  in V(G)-S$ in the graph $G -(S-{u})$. The exponential domination number, $gamma_{e}(G)$, is the smallest cardinality of an exponential dominating set....

Given a graph G = (V (G),E(G)), nonempty set S \(\subseteq\) V (G) of fixed cardinality \(\gamma\)(G) - k is called \(\zeta\)k G, where 1 \(\le\) -1, if gives the minimum |V \ NG[S]| for all possible subsets (G), each which has elements. This number vertices in are left undominated by S. In this paper, k-domination defects graphs resulting from binary operation edge corona G\(\diamond\)H charac...