Log in

Relevant bibliographies by topics / Gamma_ray / Journal articles

To see the other types of publications on this topic, follow the link: Gamma_ray.

Journal articles on the topic 'Gamma_ray'

Author: Grafiati

Published: 1 April 2023

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 18 journal articles for your research on the topic 'Gamma_ray.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

M., Manar, Mohamed S., Sherief Hashima, Imbaby I., Mohamed Amal-Eldin, and Nesreen I. "Hardware Implementation for Pileup Correction Algorithms in Gamma_Ray Spectroscopy." International Journal of Computer Applications 176, no. 6 (2017): 43–48. http://dx.doi.org/10.5120/ijca2017915634.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Nath, Rajat Kanti. "A note on super integral rings." Boletim da Sociedade Paranaense de Matemática 38, no. 4 (2019): 213–18. http://dx.doi.org/10.5269/bspm.v38i4.39637.

Full text

Abstract:

Let $R$ be a nite non-commutative ring with center $Z(R)$. The commuting graph of $R$, denoted by $\Gamma_R$, is a simple undirected graph whose vertex set is $R\setminus Z(R)$ and two distinct vertices $x$ and $y$ are adjacent if and only if $xy = yx$. Let$\Spec(\Gamma_R), \L-Spec(\GammaR)$ and $\Q-Spec(\GammaR)$ denote the spectrum, Laplacian spectrum and signless Laplacian spectrum of $\Gamma_R$ respectively. A nite non-commutative ring $R$ is called super integral if $\Spec(\Gamma_R), \L-Spec(Gamma_R)$ and $\Q-Spec(\Gamma_R)$ contain only integers. In this paper, we obtain several classes

APA, Harvard, Vancouver, ISO, and other styles

3

Zhang, Chang-Xu, Fu-Tao Hu, and Shu-Cheng Yang. "On the (total) Roman domination in Latin square graphs." AIMS Mathematics 9, no. 1 (2023): 594–606. http://dx.doi.org/10.3934/math.2024031.

Full text

Abstract:

<abstract><p>Latin square, also known as Latin square matrix, refers to a kind of $ n\times n $ matrix, in which there are exactly $ n $ different symbols and each symbol appears exactly once in each row and column. A Latin square graph $ \Gamma(L) $ is a simple graph associated with a Latin square $ L $. This paper studied the relationships between the (total) Roman domination number and (total) domination number of Latin square graph $ \Gamma(L) $. We showed that $ \gamma_{R}(\Gamma(L)) = 2\gamma(\Gamma(L)) $ or $ \gamma_{R}(\Gamma(L)) = 2\gamma(\Gamma(L))-1 $, and $ \gamma_{tR}(

APA, Harvard, Vancouver, ISO, and other styles

4

GONZÁLEZ-SÁNCHEZ, JON, and FRANCESCA SPAGNUOLO. "A BOUND ON THE p-LENGTH OF P-SOLVABLE GROUPS." Glasgow Mathematical Journal 57, no. 1 (2014): 167–71. http://dx.doi.org/10.1017/s0017089514000196.

Full text

Abstract:

AbstractLet G be a finite p-solvable group and P a Sylow p-subgroup of G. Suppose that $\gamma_{\ell (p-1)}(P)\subseteq \gamma_r(P)^{p^s}$ for ℓ(p−1) < r + s(p − 1), then the p-length is bounded by a function depending on ℓ.

APA, Harvard, Vancouver, ISO, and other styles

5

Kuryliak, A. O. "Wiman’s type inequality for entire multiple Dirichlet series with arbitrary complex exponents." Matematychni Studii 59, no. 2 (2023): 178–86. http://dx.doi.org/10.30970/ms.59.2.178-186.

Full text

Abstract:

It is proved analogues of the classical Wiman's inequality} for the class $\mathcal{D}$ of absolutely convergents in the whole complex plane $\mathbb{C}^p$ (entire) Dirichlet series of the form $\displaystyle F(z)=\sum\limits_{\|n\|=0}^{+\infty} a_ne^{(z,\lambda_n)}$ with such a sequence of exponents $(\lambda_n)$ that $\{\lambda_n\colon n\in\mathbb{Z}^p\}\subset \mathbb{C}^p$ and $\lambda_n\not=\lambda_m$ for all $n\not= m$. For $F\in\mathcal{D}$ and $z\in\mathbb{C}^p\setminus\{0\}$ we denote  $\mathfrak{M}(z,F):=\sum\limits_{\|n\|=0}^{+\infty}|a_n|e^{\Re(z,\lambda_n)},\quad\mu(z,F):=\s

APA, Harvard, Vancouver, ISO, and other styles

6

Nithishraj, S., A. Nagoor Gani, and P. Muruganantham. "Domination and Independence in Fuzzy Semigraphs." Indian Journal Of Science And Technology 17, no. 34 (2024): 3580–88. http://dx.doi.org/10.17485/ijst/v17i34.2133.

Full text

Abstract:

Objectives: To identify dominating and independent sets in fuzzy semigraphs by developing suitable methods. To examine dominating and independent sets in fuzzy semigraphs for their characteristics and behaviors. The goal is to examine the use of the concepts of domination and independence in the fields of analysis of social networks, security of networks, and allocation of resources. Methods: This study introduces the concept of strong arc fuzzy semigraph and explores various parameters such as dominating and independent sets. The Minimum Adjacent Dominating Number (ad-number) \gamma_a(\operat

APA, Harvard, Vancouver, ISO, and other styles

7

Sheikholeslami, Seyed Mahmoud, Nasrin Dehgardi, Lutz Volkmann, and Dirk Meierling. "The Roman bondage number of a digraph." Tamkang Journal of Mathematics 47, no. 4 (2016): 421–31. http://dx.doi.org/10.5556/j.tkjm.47.2016.2100.

Full text

Abstract:

Let $D=(V,A)$ be a finite and simple digraph. A Roman dominating function on $D$ is a labeling $f:V (D)\rightarrow \{0, 1, 2\}$ such that every vertex with label 0 has an in-neighbor with label 2. The weight of an RDF $f$ is the value $\omega(f)=\sum_{v\in V}f (v)$. The minimum weight of a Roman dominating function on a digraph $D$ is called the Roman domination number, denoted by $\gamma_{R}(D)$. The Roman bondage number $b_{R}(D)$ of a digraph $D$ with maximum out-degree at least two is the minimum cardinality of all sets $A'\subseteq A$ for which $\gamma_{R}(D-A')>\gamma_R(D)$. In this p

APA, Harvard, Vancouver, ISO, and other styles

8

S, Nithishraj, Nagoor Gani A, and Muruganantham P. "Domination and Independence in Fuzzy Semigraphs." Indian Journal of Science and Technology 17, no. 34 (2024): 3580–88. https://doi.org/10.17485/IJST/v17i34.2133.

Full text

Abstract:

Abstract <strong>Objectives:</strong> To identify dominating and independent sets in fuzzy semigraphs by developing suitable methods. To examine dominating and independent sets in fuzzy semigraphs for their characteristics and behaviors. The goal is to examine the use of the concepts of domination and independence in the fields of analysis of social networks, security of networks, and allocation of resources. <strong>Methods:</strong> This study introduces the concept of strong arc fuzzy semigraph and explores various parameters such as dominating and independent sets. The Minim

APA, Harvard, Vancouver, ISO, and other styles

9

Alshahrani, Fatimah, Wahiba Bouabsa, Ibrahim M. Almanjahie, and Mohammed Kadi Attouch. "Robust kernel regression function with uncertain scale parameter for high dimensional ergodic data using $ k $-nearest neighbor estimation." AIMS Mathematics 8, no. 6 (2023): 13000–13023. http://dx.doi.org/10.3934/math.2023655.

Full text

Abstract:

<abstract><p>In this paper, we consider a new method dealing with the problem of estimating the scoring function $ \gamma_a $, with a constant $ a $, in functional space and an unknown scale parameter under a nonparametric robust regression model. Based on the $ k $ Nearest Neighbors ($ k $NN) method, the primary objective is to prove the asymptotic normality aspect in the case of a stationary ergodic process of this estimator. We begin by establishing the almost certain convergence of a conditional distribution estimator. Then, we derive the almost certain convergence (with rate)

APA, Harvard, Vancouver, ISO, and other styles

10

Kannaiyan, Ashok, Sekarapandian Natarajian, and B. R. Vinoth. "Stability of a laminar pipe flow subjected to a step-like increase in the flow rate." Physics of Fluids, May 15, 2022. http://dx.doi.org/10.1063/5.0090337.

Full text

Abstract:

We perform the linear modal stability analysis of a pipe flow subjected to a step-like increment in the flow rate from a steady initial flow with flow rate, $Q_i$, to a final flow with flow rate, $Q_f$, at the time, $t_c$. A step-like increment in the flow rate induces a non-periodic unsteady flow for a definite time interval. The ratio, $\Gamma_a={Q}_i/{Q}_f$, parameterizes the increase in the flow rate, and it ranges between $0$ to $1$. The stability analysis for a pipe flow subjected to a step-like increment in the flow rate from the steady laminar flow ($\Gamma_a&gt;0$) is not reported

APA, Harvard, Vancouver, ISO, and other styles

11

Cools, Filip, and Marta Panizzut. "The Gonality Sequence of Complete Graphs." Electronic Journal of Combinatorics 24, no. 4 (2017). http://dx.doi.org/10.37236/6876.

Full text

Abstract:

The gonality sequence $(\gamma_r)_{r\geq1}$ of a finite graph/metric graph/algebraic curve comprises the minimal degrees $\gamma_r$ of linear systems of rank $r$. For the complete graph $K_d$, we show that $\gamma_r = kd - h$ if $r<g=\frac{(d-1)(d-2)}{2}$, where $k$ and $h$ are the uniquely determined integers such that $r = \frac{k(k+3)}{2} - h$ with $1\leq k\leq d-3$ and $0 \leq h \leq k $. This shows that the graph $K_d$ has the gonality sequence of a smooth plane curve of degree $d$. The same result holds for the corresponding metric graphs.

APA, Harvard, Vancouver, ISO, and other styles

12

Kim, Kijung. "Italian, 2-rainbow and Roman domination numbers in middle graphs." RAIRO - Operations Research, March 25, 2024. http://dx.doi.org/10.1051/ro/2024072.

Full text

Abstract:

Given a graph $G$, we consider the Italian domination number $\gamma_I(G)$, the $2$-rainbow domination number $\gamma_{r2}(G)$ and the Roman domination number $\gamma_R(G)$. It is known that $\gamma_I(G) \leq \gamma_{r2}(G) \leq \gamma_R(G)$ holds for any graph $G$. In this paper, we prove that $\gamma_I(M(G)) =\gamma_{r2}(M(G)) =\gamma_R(M(G)) =n$ for the middle graph $M(G)$ of a graph $G$ of order $n$, which gives an answer for an open problem posed by Mustapha Chellali et al. [Discrete Applied Mathematics 204 (2016) 22--28]. Moreover, we give a complete characterization of Roman domination

APA, Harvard, Vancouver, ISO, and other styles

13

Favaron, Odile. "Global Alliances and Independent Domination in Some Classes of Graphs." Electronic Journal of Combinatorics 15, no. 1 (2008). http://dx.doi.org/10.37236/847.

Full text

Abstract:

A dominating set $S$ of a graph $G$ is a global (strong) defensive alliance if for every vertex $v\in S$, the number of neighbors $v$ has in $S$ plus one is at least (greater than) the number of neighbors it has in $V\setminus S$. The dominating set $S$ is a global (strong) offensive alliance if for every vertex $v\in V\setminus S$, the number of neighbors $v$ has in $S$ is at least (greater than) the number of neighbors it has in $V\setminus S$ plus one. The minimum cardinality of a global defensive (strong defensive, offensive, strong offensive) alliance is denoted by $\gamma_a(G)$ ($\gamma_

APA, Harvard, Vancouver, ISO, and other styles

14

Najafi, Hamed. "An extension of the van Hemmen–Ando norm inequality." Glasgow Mathematical Journal, August 3, 2022, 1–7. http://dx.doi.org/10.1017/s0017089522000155.

Full text

Abstract:

Abstract Let $C_{\||.\||}$ be an ideal of compact operators with symmetric norm $\||.\||$ . In this paper, we extend the van Hemmen–Ando norm inequality for arbitrary bounded operators as follows: if f is an operator monotone function on $[0,\infty)$ and S and T are bounded operators in $\mathbb{B}(\mathscr{H}\;\,)$ such that ${\rm{sp}}(S),{\rm{sp}}(T) \subseteq \Gamma_a=\{z\in \mathbb{C} \ | \ {\rm{re}}(z)\geq a\}$ , then \begin{equation*}\||f(S)X-Xf(T)\|| \leq\;f'(a) \ \||SX-XT\||,\end{equation*} for each $X\in C_{\||.\||}$ . In particular, if ${\rm{sp}}(S), {\rm{sp}}(T) \subseteq \Gamma_a$

APA, Harvard, Vancouver, ISO, and other styles

15

Azami Aghdash, Akbar, Nader Jafari Rad, and Bahram Vakili Fasaghandisi. "On the restrained domination stability in graphs." RAIRO - Operations Research, December 31, 2024. https://doi.org/10.1051/ro/2024233.

Full text

Abstract:

‎A subset $S$ of vertices of a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in $S$‎. ‎A dominating set $S$ is a restrained dominating set if for each vertex $x\in V(G)-S$ there is a vertex $y\in V(G)-S$ such that $xy\in E(G)$‎. ‎The restrained domination number of $G$‎, ‎denoted by $\gamma_r(G)$ is the minimum cardinality of a restrained dominating set of $G$‎. ‎The restrained domination stability number of $G$‎, ‎denoted by $st_{\gamma_r}(G)$‎, ‎is the minimum number of vertices whose‎ ‎removal changes the restrained domination number of $G$‎. ‎In this pape

APA, Harvard, Vancouver, ISO, and other styles

16

Fuidah, Quthrotul Aini, Dafik Dafik, and Ermita Rizki Albirri. "Resolving Domination Number pada Keluarga Graf Buku." CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS 1, no. 2 (2020). http://dx.doi.org/10.25037/cgantjma.v1i2.44.

Full text

Abstract:

All graph in this paper are members of family of book graph. Let $G$ is a connnected graph, and let $W = \{w_1,w_2,...,w_i\}$ a set of vertices which is dominating the other vertices which are not element of $W$, and the elements of $W$ has a different representations, so $W$ is called resolving dominating set. The minimum cardinality of resolving dominating set is called resolving domination number, denoted by $\gamma_r(G)$. In this paper we obtain the exact values of resolving dominating for family of book graph.

APA, Harvard, Vancouver, ISO, and other styles

17

Jiang, Hechuan, Dongpu Wang, Yu Cheng, Huageng Hao, and Chao Sun. "Effects of ratchet surfaces on inclined thermal convection." Physics of Fluids, December 27, 2022. http://dx.doi.org/10.1063/5.0130492.

Full text

Abstract:

The influence of ratchets on inclined convection is explored within a rectangular cell (aspect ratio $\Gamma_{x}=1$ and $\Gamma_y=0.25$) by experiments and simulations. The measurements are conducted over a wide range of tilting angles ($0.056\leq\beta\leq \pi/2\,\si{\radian}$) at a constant Prandtl number ($\text{Pr}=4.3$) and Rayleigh number ($\text{Ra}=5.7\times10^9$). We found that the arrangement of ratchets on the conducting plate determines the dynamics of inclined convection, i.e., when the large-scale circulation (LSC) flows along the smaller slopes of the ratchets (case A), the chang

APA, Harvard, Vancouver, ISO, and other styles

18

Nguyen, Ba Phi, and Kihong Kim. "Transport and localization properties of excitations in one-dimensional lattices with diagonal disordered mosaic modulations." Journal of Physics A: Mathematical and Theoretical, October 16, 2023. http://dx.doi.org/10.1088/1751-8121/ad03cd.

Full text

Abstract:

Abstract We present a numerical study of the transport and localization properties of excitations in one-dimensional lattices with diagonal disordered mosaic modulations. The model is characterized by the modulation period $\kappa$ and the disorder strength $W$. We calculate the disorder averages $\langle T\rangle$, $\langle \ln T\rangle$, and $\langle P\rangle$, where $T$ is the transmittance and $P$ is the participation ratio, as a function of&#xD;energy $E$ and system size $L$, for different values of $\kappa$ and $W$. For excitations at quasiresonance energies determined by $\kappa$, w

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!