Results 21 to 30 of about 641,798 (254)
Hexagonal Difference Prime Labeling of Some Path Graphs [PDF]
, 2017 Hexagonal difference prime labeling of vertices of a graph is the labeling of the vertices of the graph with hexagonal numbers and the edges with absolute value of the difference of the labels of the incident vertices.
Sunoj, B S, Varkey, Mathew T K
core +1 more source
Some results on cordiality labeling of generalized Jahangir graph
Indonesian Journal of Combinatorics, 2017 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
Conflict vs Causality in Event Structures [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Event structures are one of the best known models for concurrency. Many variants of the basic model and many possible notions of equivalence for them have been devised in the literature.
Daniele Gorla +2 more
doaj +1 more source
SCOOTER: A compact and scalable dynamic labeling scheme for XML updates [PDF]
, 2012 Although dynamic labeling schemes for XML have been the focus of recent research activity, there are significant challenges still to be overcome. In particular, though there are labeling schemes that ensure a compact label representation when creating ...
O\u27Connor, Martin F. +4 more
core +2 more sources
Prime and Odd Prime Labelings on Cycle-Related Graphs
Science and Technology IndonesiaGraph labeling is the process of determining integer values for vertices, edges, or both, based on certain criteria. Let G be a simple graph with the finite vertex set V(G). Prime labeling of G is a bijection ⍺:V(G)→{1,2,…,|V(G)|} for which each pair of
Hafif Komarullah +3 more
doaj +1 more source
ON PRIME LABELING OF HERSCHEL GRAPH
, 2016 A graph with vertex set is said to have a prime labeling if its vertices are labeled with distinct integers such that for each the labels assigned to and are relatively prime.
Dr. K. Balamurugan, V. Ganesan
core +1 more source
ON PRIME LABELING OF THETA GRAPH
, 2016 A graph with vertex set is said to have a prime labeling if its vertices are labeled with distinct integers such that for each edge the labels assigned to and are relatively prime. A graph which admits prime labeling is called a prime graph.
Dr. K. Balamurugan, V. Ganesan
core +1 more source
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
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
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