Results 21 to 30 of about 29,470 (238)
Distance antimagic labeling of join and corona of two graphs
AKCE International Journal of Graphs and Combinatorics, 2017 Let be a graph of order . Let be a bijection. The weight of a vertex with respect to is defined by , where is the open neighborhood of . The labeling is said to be distance antimagic if for every pair of distinct vertices .
A.K. Handa +3 more
doaj +1 more source
Five-Qubit Contextuality, Noise-Like Distribution of Distances Between Maximal Bases and Finite Geometry [PDF]
, 2012 Employing five commuting sets of five-qubit observables, we propose specific 160-661 and 160-21 state proofs of the Bell-Kochen-Specker theorem that are also proofs of Bell's theorem.
Aravind +20 more
core +4 more sources
Union of Distance Magic Graphs
Discussiones Mathematicae Graph Theory, 2017 A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ from V to the set {1, . . . , n} such that the weight w(x) = ∑y∈NG(x) ℓ(y) of every vertex x ∈ V is equal to the same element μ, called the magic constant.
Cichacz Sylwia, Nikodem Mateusz
doaj +1 more source
Group distance magic labeling of direct product of graphs
Ars Mathematica Contemporanea, 2014 A distance magic labeling of a graph of order \(n\) is a bijection from the vertex set to \(\{0,1,\dots,n-1\}\) such that the sum of neighbors of any vertex is the same. Magic labellings of graphs have been studied as a generalization of magic squares. A central question has been to identify which graphs admit such labelings.
Anholcer, Marcin +3 more
openaire +4 more sources
Distance Magic Cartesian Products of Graphs
Discussiones Mathematicae Graph Theory, 2016 A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ : V → {1, . . . , n} such that the weight of every vertex v, computed as the sum of the labels on the vertices in the open neighborhood of v, is a constant.
Cichacz Sylwia +3 more
doaj +1 more source
An open source LABVIEW platform for simulating image series of fluorescent microtubules in gliding assays [PDF]
, 2010 We describe an open-source LabVIEW software platform for generating simulated images of microtubules in gliding motility assays.
Lawrence J. Herskowitz, Steven J. Koch
core +2 more sources
Orientable ℤN-Distance Magic Graphs
Discussiones Mathematicae Graph Theory, 2019 Let G = (V, E) be a graph of order n. A distance magic labeling of G is a bijection ℓ: V → {1, 2, . . ., n} for which there exists a positive integer k such that ∑x∈N(v)ℓ(x) = k for all v ∈ V, where N(v) is the open neighborhood of v.
Cichacz Sylwia +2 more
doaj +1 more source
Distance magic labelling of Mycielskian graphs
Electronic Journal of Graph Theory and ApplicationsSummary: A graph \(G = (V, E)\), where \(|V(G)| = n\) and \(|E(G)| = m\) is said to be a distance magic graph if there is a bijection \(f : V(G) \rightarrow \{1, 2, \dots, n\}\) such that the vertex weight \(w(u)= \sum_{v\in N(u)}f(v)=k\) is constant and independent of \(u\), where \(N(u)\) is an open neighborhood of the vertex \(u\). The constant \(k\)
Ravindra Kuber Pawar, Tarkeshwar Singh
openaire +1 more source
, 2020 A graceful labeling of a graph $G$ with $m$ edges consists of labeling the vertices of $G$ with distinct integers from $0$ to $m$ such that, when each edge is assigned as induced label the absolute difference of the labels of its endpoints, all induced ...
Dantas, Simone +2 more
core +2 more sources
Clothing Co-Parsing by Joint Image Segmentation and Labeling [PDF]
, 2014 This paper aims at developing an integrated system of clothing co-parsing, in order to jointly parse a set of clothing images (unsegmented but annotated with tags) into semantic configurations.
Lin, Liang, Luo, Ping, Yang, Wei
core +2 more sources