Results 261 to 270 of about 612,378 (298)

On prime distance labeling of graphs

2017 International Conference On Smart Technologies For Smart Nation (SmartTechCon), 2017
A graph G is a prime distance graph if its vertices can be labeled with distinct integers in such a way that for any two adjacent vertices, the absolute difference of their labels is a prime number. It is known that cycles and bipartite graphs are prime distance graphs. In this paper we derive certain general results concerning prime distance labeling.
A. Parthiban, N. Gnanamalar David
exaly   +3 more sources

Study on Neighborhood Prime Labeling

2021
A labeling or numbering of a graph G is an assignment of labels to the vertices of G that induces for each edge uv a labeling depending on the vertex labels f(u) and f(v). In this paper, neighborhood prime labeling of Star graph, Complete bipartite graph, Fan graph, Friendship graph, Flower graph, Bistar graph, Comb graph, splitting graph of Pn and ...
exaly   +2 more sources

On the Prime Labeling of Graphs

Journal of Computational and Theoretical Nanoscience, 2014
Fei Deng
exaly   +2 more sources

On prime labeling of union of tadpole graphs

Commentationes Mathematicae Universitatis Carolinae, 2022
A prime labeling of a graph \(G=(V,E)\) is a bijection \(f:V\to\{1,2,\dots ,|E|\}\) such that for any two adjacent vertices \(x,y\), the labels \(f(x)\) and \(f(y)\) are relatively prime. A graph allowing a prime labeling is called a prime graph. The tadpole graph \(T_{n,m}\) is a graph on \(n+m\) vertices and \(n+m\) edges arising from the cycle \(C_n\
Patel, Sanjaykumar K., Vasava, Jayesh B.
openaire   +1 more source

ON PRIMENESS OF LABELED ORIENTED TREES

Journal of Knot Theory and Its Ramifications, 2012
Knot complements are aspherical. Whether this extends to ribbon disc complements, or, equivalently, to standard 2-complexes of labeled oriented trees, remains unresolved. It is known that prime injective labeled oriented trees are diagrammatically reducible, that is, aspherical in a strong combinatorial sense.
Harlander, Jens, Rosebrock, Stephan
openaire   +3 more sources

Primed in Situ labeling

2001
Publisher Summary Primed in situ labeling (PRINS) is a fast and sensitive technique for sequence specific in situ detection of DNA. An unlabeled oligonucleotide probe is hybridized and used as primer for chain elongation in situ catalyzed by a DNA polymerase.
J, Hindkjaer, L, Bolund, S, Kølvraa
openaire   +2 more sources

On prime labelings of Fibonacci trees

Involve, a Journal of Mathematics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Larsen, Bayley, Lehmann, Hunter, Park, Andrew, Robertson, Leanne   +3 more
openaire   +2 more sources

Unintentional affective priming during labeling may bias labels

2019 8th International Conference on Affective Computing and Intelligent Interaction (ACII), 2019
Online platforms displaying long streams of examples are often employed to gather labels from both experts and crowd workers. While previous work in crowdsourcing focused on objective tasks and estimating error parameters of annotators, collecting labels in a subjective setting (e.g.
Judy Hanwen Shen, Àgata Lapedriza, Rosalind W. Picard   +2 more
openaire   +2 more sources

Random Primed Labeling of DNA

2003
Random primed labeling of DNA has now almost superseded the method of nick translation of DNA. Random primed labeling, based on the method of Feinberg and Vogelstein (1) is a method of incorporating radioactive nucleotides along the length of a fragment of DNA.
openaire   +2 more sources

Prime labeling and prime distance labeling of some classes of graphs

AIP Conference Proceedings, 2023
Ram Dayal, A. Parthiban
openaire   +1 more source