Servedio et al. [1], following Gavrilets [2], define a magic trait as ‘a trait subject to divergent selection and a trait contributing to non-random mating that are pleiotropic expressions of the same gene(s)’. This clarified definition is certainly helpful, but we outline here several pivotal questions for empirical research, particularly surrounding the crucial concept of effect size. The eff...

Background: Accurate small radiation field dosimetry is essential in modern radiotherapy techniques such as stereotactic radiosurgery (SRS) and intensity modulated radiotherapy (IMRT). Precise measurement of dosimetric parameters such as beam profile, percentage depth doses and output factor of these beams are complicated due to the electron disequilibrium and the steep dose gradients. In the p...

Abstract : In this paper we introduced the concept of complementary super edge magic labeling and Complementary Super Edge Magic strength of a graph G.A graph G (V, E ) is said to be complementary super edge magic if there exist a bijection f:V U E → { 1, 2, ............p+q } such that p+q+1 f(x) is constant. Such a labeling is called complementary super edge magic labeling with complementary s...

MAGIC-web is the first web server, to the best of our knowledge, that performs both untargeted and targeted analyses of mass spectrometry-based glycoproteomics data for site-specific N-linked glycoprotein identification. The first two modules, MAGIC and MAGIC+, are designed for untargeted and targeted analysis, respectively. MAGIC is implemented with our previously proposed novel Y1-ion pattern...

Let G = (V, E) be a graph on n vertices. A bijection f : V → {1, 2, . . . , n} is called a distance magic labeling of G if there exists an integer k such that ∑ u∈N(v) f(u) = k for all v ∈ V , where N(v) is the set of all vertices adjacent to v. The constant k is the magic constant of f and any graph which admits a distance magic labeling is a distance magic graph. In this paper we solve some o...

There are many results on edge-magic, and vertex-magic, labellings of finite graphs. Here we consider magic labellings of countably infinite graphs over abelian groups. We also give an example of a finite connected graph that is edge-magic over one, but not over all, abelian groups of the appropriate order.

Magic squares have turned up throughout history, some in a mathematical context, others in philosophical or religious contexts. According to legend, the first magic square was discovered in China by an unknown mathematician sometime before the first century A.D. It was a magic square of order three thought to have appeared on the back of a turtle emerging from a river. Other magic squares surfa...