Results 111 to 120 of about 59,758 (255)
Chemical Shift Separated and Compensated Ultra‐Short Echo‐Time Imaging
Magnetic Resonance in Medicine, EarlyView.ABSTRACT Purpose To develop a modified binomial excitation scheme for ultra‐short echo‐time (UTE) imaging that allows for the separation of water and fat signals and the correction of chemical shift artifacts. Methods Theoretical derivation and numerical Bloch simulations were performed for a modified water‐excitation binomial pulse scheme to calculate
Martin Krämer +3 more
wiley +1 more source
The irregularity of graphs under graph operations
Discussiones Mathematicae Graph Theory, 2014 The irregularity of a simple undirected graph G was defined by Albertson [5] as irr(G) = ∑uv∈E(G) |dG(u) − dG(v)|, where dG(u) denotes the degree of a vertex u ∈ V (G).
Abdo Hosam, Dimitrov Darko
doaj +1 more source
A Class of Graphs Approaching Vizing's Conjecture
Theory and Applications of Graphs, 2016 For any graph G=(V,E), a subset S of V dominates G if all vertices are contained in the closed neighborhood of S, that is N[S]=V. The minimum cardinality over all such S is called the domination number, written γ(G). In 1963, V.G. Vizing conjectured that
Aziz Contractor, Elliot Krop
doaj +1 more source
Free‐Breathing Magnetization Transfer Imaging of the Lung at 0.55 T Using bSTAR
Magnetic Resonance in Medicine, EarlyView.ABSTRACT Purpose To develop a clinically applicable method for magnetization transfer (MT) imaging of the lung at 0.55 T. Methods MT imaging of the chest was explored in healthy volunteers at 0.55 T using a self‐gated 3D half‐radial dual‐echo balanced steady‐state free precession sequence (bSTAR), a 2D multi‐slice gradient echo method (GRE) acquired in
Alexandra Braun +5 more
wiley +1 more source
Monotone Chromatic Number of Graphs
International Journal of Analysis and Applications, 2020 For a graph G = (V, E), a vertex coloring (or, simply, a coloring) of G is a function C: V (G) → {1, 2, ..., k} (using the non-negative integers {1, 2, ..., k} as colors).
Anwar Saleh +3 more
doaj
Molecules, 2018 The Cartesian product and join are two classical operations in graphs. Let dL(G)(e) be the degree of a vertex e in line graph L(G) of a graph G. The edge versions of atom-bond connectivity (ABCe) and geometric arithmetic (GAe) indices of G are defined as
Xiujun Zhang +3 more
doaj +1 more source
2- Cartesian Product of Special Graphs
International Journal of Mathematics and Soft Computing, 2014 The cartesian product of two graphs has been studied by many authors and has been generalized by introducing 2 - cartesian product G1 _2 G2 of two graphs G1 and G2. In this paper, we obtain G1 _2 G2; for Pn, Cn and Ks;t.
Himali S. Mehta, U. P. Acharya
openaire +1 more source
Integer domination of Cartesian product graphs
Discrete Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Choudhary, K. +2 more
openaire +1 more source
NowPrecip 2: Precipitation nowcasting in the complex terrain of Switzerland. Part I: Methods
Quarterly Journal of the Royal Meteorological Society, EarlyView.In this work we present the methods of the areal precipitation nowcasting system NowPrecip version 2. In this version a new methodology is introduced, which, although it shares philosophy and techniques with the original methodology of NowPrecip version 1, can be considered as distinct from that.
I. V. Sideris +7 more
wiley +1 more source
FORWARDING INDICES OF CARTESIAN PRODUCT GRAPHS
Taiwanese Journal of Mathematics, 2006 For a given connected graph $G$ of order $n$, a routing $R$ is a set of $n(n-1)$ elementary paths specified for every ordered pair of vertices in $G$. The vertex-forwarding index $\xi(G)$ (the edge-forwarding index $\pi(G)$) of $G$ is the maximum number of paths of $R$ passing through any vertex (resp. edge) in $G$. In this paper we consider the vertex-
Xu, Jun-Ming, Xu, Min, Hou, Xinmin
openaire +2 more sources