Results 51 to 60 of about 141,920 (188)
Some results on SD-Prime cordial labeling [PDF]
Proyecciones (Antofagasta), 2017 Given a bijection ʄ : V(G) → {1,2, …,|V(G)|}, we associate 2 integers S = ʄ(u)+ʄ(v) and D = |ʄ(u)-ʄ(v)| with every edge uv in E(G). The labeling ʄ induces an edge labeling ʄ'' : E(G) → {0,1} such that for any edge uv in E(G), ʄ '(uv)=1 if gcd(S,D)=1, and ʄ ' (uv)=0 otherwise. Let eʄ ' (i) be the number of edges labeled with i ∈ {0,1}.
Lourdusamy, A., Patrick, F.
openaire +2 more sources
Pelabelan Prima pada Kelas Graf Hasil Operasi Perkalian Tensor
Jambura Journal of MathematicsA graph with a vertex set is said to be a prime graph if there exists a bijective mapping , where denotes the number of vertices in , such that for any two adjacent vertices and in have . Tensor Product graph is a way to combine (compose)
Suci Triwahyuniti, Desi Rahmadani
doaj +1 more source
Indonesian Journal of Biotechnology, 2005 The goal of the research was to develop a homolog sequence of Eimeria tenella partial genome as a molecular probe for diagnose coccidiosis using dot blot method.
S. Sumartono
doaj +1 more source
Frontiers in Behavioral Neuroscience, 2020 To study the mechanisms of perception and cognition, neural measurements must be made during behavior. A goal of the Allen Brain Observatory is to map the activity of distinct cortical cell classes underlying visual and behavioral processing.
Peter A. Groblewski +12 more
doaj +1 more source
Dose-Response, 2021 Somatostatin receptors (SStR) based 177 Lu-DOTATATE therapy is known as one of the highly effective neuroendocrine tumors (NETs) treatment strategy. Development of DOTATATE freeze-dried kit for imaging and therapy of SStR positive NETs is a prime goal in
Samina Roohi +2 more
doaj +1 more source
Radio numbers for generalized prism graphs
, 2010 A radio labeling is an assignment $c:V(G) \rightarrow \textbf{N}$ such that every distinct pair of vertices $u,v$ satisfies the inequality $d(u,v)+|c(u)-c(v)|\geq \diam(G)+1$. The span of a radio labeling is the maximum value.
Martinez, Paul +3 more
core +1 more source
Some New Results on Prime Cordial Labeling [PDF]
ISRN Combinatorics, 2014 A prime cordial labeling of a graph G with the vertex set V(G) is a bijection f:V(G)→{1,2,3,…,|V(G)|} such that each edge uv is assigned the label 1 if gcd(f(u),f(v))=1 and 0 if gcd(f(u),f(v))>1; then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph which admits a prime cordial labeling is called
Vaidya, S. K., Shah, N. H.
openaire +2 more sources
On k-edge-magic labelings of maximal outerplanar graphs
AKCE International Journal of Graphs and Combinatorics, 2015 Let G be a graph with vertex set V and edge set E such that |V|=p and |E|=q. We denote this graph by (p,q)-graph. For integers k≥0, define a one-to-one map f from E to {k,k+1,…,k+q−1} and define the vertex sum for a vertex v as the sum of the labels of ...
Gee-Choon Lau +3 more
doaj +1 more source
High-Throughput Single-Cell Labeling (Hi-SCL) for RNA-Seq Using Drop-Based Microfluidics. [PDF]
PLoS ONE, 2015 The importance of single-cell level data is increasingly appreciated, and significant advances in this direction have been made in recent years. Common to these technologies is the need to physically segregate individual cells into containers, such as ...
Assaf Rotem +8 more
doaj +1 more source
Prime Labeling of Jahangir Graphs
International Journal of Engineering & Technology, 2018 The paper investigates prime labeling of Jahangir graph Jn,m  for n ≥ 2, m ≥ 3 provided that nm is even. We discuss prime labeling of some graph operations viz. Fusion, Switching and Duplication to prove that the Fusion of two vertices v1 and vk where k is odd in a Jahangir graph Jn,m results to prime graph provided that the product nm is even ...
Anantha Lakshmi. +2 more
openaire +2 more sources