Results 21 to 30 of about 38,200 (260)
Some results on cordiality labeling of generalized Jahangir graph
In this paper we consider the cordiality of a generalized Jahangir graph $J_{n,m}$. We give sufficient condition for $J_{n,m}$ to admit (or not admit) the prime cordial labeling, product cordial labeling and total product cordial labeling.
Roslan Hasni +2 more
doaj +1 more source
Review of Post-embedding Immunogold Methods for the Study of Neuronal Structures
The post-embedding immunogold (PI) technique for immunolabeling of neuronal tissues utilizing standard thin-section transmission electron microscopy (TEM) continues to be a prime method for understanding the functional localization of key proteins in ...
Ronald S. Petralia, Ya-Xian Wang
doaj +1 more source
A graph G with m vertices and n edges, is said to be prime graceful labeling, if there is an injection from the vertices of G to {1, 2, ..., k} where k = min {2m, 2n} such that gcd ( ( ), ( )=1 and the induced injective function from the edges of G to {1, 2, ..., k − 1} defined by ( ) = | ( ) − ( ) | , the resulting edge labels are distinct. In
T. Hameed Hassan, R. Mohammad Abbas
openaire +2 more sources
On a Question of Prime Labeling of Graphs
In the field of graph theory, the complete graph of vertices is a simple undirected graph such that every pair of distinct vertices is connected by a unique edge. In the present work, we introduce planar subgraph of with maximal number of edges . Generally, does not admit prime labeling. We present an algorithm to obtain prime-labeled subgraphs of
P. G. R. S. Ranasinghe +1 more
openaire +2 more sources
Biological data annotation via a human-augmenting AI-based labeling system
Biology has become a prime area for the deployment of deep learning and artificial intelligence (AI), enabled largely by the massive data sets that the field can generate. Key to most AI tasks is the availability of a sufficiently large, labeled data set
Douwe van der Wal +13 more
doaj +1 more source
Prime labelings on a 3xn grid graph
It is conjectured that the mxn grid graph has a prime labeling for all positive integers m and n. It is known that for any prime p and any integer n such that 1≤n≤p2, there exists a prime labeling on the pxn grid graph Pm x Pn. Also, it is known that the
Stephen J. Curran, Matt A. Ollis
doaj +1 more source
We show that some special families of graphs have prime cordial labeling. We prove that If G is not a prime cordial graph of order m then G∪K_(1,n)is a prime cordial graph if E(G)= n-1,n or n+1 , and we prove that S^' (K_(2,n)), Jelly fish graph , Jewel graph, the graph obtained by duplicating a vertex v_k in the rim of the helm H_nand the graph ...
M. A. Seoud +2 more
openaire +1 more source
Certain Results on Prime and Prime Distance Labeling of Graphs
Abstract Let G be a graph on n vertices. A bijective function f : V (G) → {1, 2,…,n} is said to be a prime labeling if for every e = xy, GCD{f (x),f (y)} = 1. A graph which permits a prime labeling is a “prime graph”. On the other hand, a graph G is a prime distance graph if there is an injective function g : V(G) → Z (the set of all ...
A. Parthiban, Ajaz Ahmad Pir, A. Felix
openaire +1 more source
In this paper we introduce neighborhood-prime labeling and investigate neighborhoodprime labelings for paths, cycles, helm, closed helm and flower. Also we establish a sufficient condition for a graph to admit neighborhood-prime labeling.
N. N. Shrimali, S. K. Patel
openaire +1 more source
multicrispr: gRNA design for prime editing and parallel targeting of thousands of targets
A bioinformatics R package for a fast and generic guideRNA design, optimized for large-scale perturbation assays. Targeting the coding genome to introduce nucleotide deletions/insertions via the CRISPR/Cas9 technology has become a standard procedure.
Aditya M Bhagwat +8 more
doaj +1 more source

