Results 41 to 50 of about 612,378 (298)
International Journal of Engineering & Technology, 2018 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
Review of Post-embedding Immunogold Methods for the Study of Neuronal Structures
Frontiers in Neuroanatomy, 2021 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
Some Prime Labeling Results of H-Class Graphs [PDF]
, 2013 Prime labeling originated with Entringer and was introduced by Tout, Dabboucy and Howalla. A Graph G(V,E) is said to have a prime labeling if its vertices are labeled with distinct integers 1, 2, 3, · · · , |V (G)| such that for each edge xy the labels ...
A.Nagarajan +3 more
core +1 more source
Biological data annotation via a human-augmenting AI-based labeling system
npj Digital Medicine, 2021 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
Vertex Graceful Labeling-Some Path Related Graphs [PDF]
, 2013 Treating subjects as vertex graceful graphs, vertex graceful labeling, caterpillar, actinia graphs, Smarandachely vertex m ...
Balaganesan, P. +2 more
core +1 more source
Prime labelings on a 3xn grid graph
Theory and Applications of GraphsIt 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
Certain Results on Prime and Prime Distance Labeling of Graphs
Journal of Physics: Conference Series, 2020 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
International Journal of Mathematics and Soft Computing, 2015 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
On a Question of Prime Labeling of Graphs
Journal of Advances in Mathematics and Computer Science, 2021 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
FEBS Letters, EarlyView.Structural and biochemical characterisations show that the planar cell polarity (PCP) protein Inturned harbours a unique PDZ‐like domain that does not bind canonical PDZ‐binding motifs (PBMs) like that of another PCP protein Vangl2. In contrast, the apical‐basal polarity protein Scribble contains four PDZ domains that bind Vangl2, but one PDZ domain ...
Stephan Wilmes +4 more
wiley +1 more source