Results 1 to 10 of about 29,335 (219)
Orientable Z_n-distance magic labeling of the Cartesian product of many cycles [PDF]
Electronic Journal of Graph Theory and Applications, 2017 The following generalization of distance magic graphs was introduced in [2]. A directed Z_n-distance magic labeling of an oriented graph $\overrightarrow{G}=(V,A)$ of order n is a bijection $\overrightarrow{\ell}\colon V \rightarrow Z_n$ with the ...
Bryan Freyberg, Melissa Keranen
core +9 more sources
Distance magic-type and distance antimagic-type labelings of graphs [PDF]
, 2017 Generally speaking, a distance magic-type labeling of a graph G of order n is a bijection f from the vertex set of the graph to the first n natural numbers or to the elements of a group of order n, with the property that the weight of each vertex is the ...
Bryan Freyberg
core +5 more sources
Distance magic labelings of Cartesian products of cycles
Discrete MathematicsA graph of order $n$ is distance magic if it admits a bijective labeling of its vertices with integers from $1$ to $n$ such that each vertex has the same sum of the labels of its neighbors.
Ksenija Rozman, Primož Šparl
core +5 more sources
Pelabelan Jarak Tak Teratur Titik Pada Graf Persahabatan Lengkap Diperumum [PDF]
, 2023 Graph labeling is the labeling of graph elements such as vertex, edge and both. distance vertex irregular labeling is a type of labeling resulting from the development of distance magic labeling and (a, b)-distance anti-magic labeling.
Majid, Cindy Ainun +3 more
core +2 more sources
Note on group distance magic graphs $G[C_4]$ [PDF]
, 2012 A \emph{group distance magic labeling} or a $\gr$-distance magic labeling of a graph $G(V,E)$ with $|V | = n$ is an injection $f$ from $V$ to an Abelian group $\gr$ of order $n$ such that the weight $w(x)=\sum_{y\in N_G(x)}f(y)$ of every vertex $x \in V$
D. Froncek +3 more
core +2 more sources
Regular graphs of odd degree are antimagic [PDF]
, 2013 An antimagic labeling of a graph $G$ with $m$ edges is a bijection from $E(G)$ to $\{1,2,\ldots,m\}$ such that for all vertices $u$ and $v$, the sum of labels on edges incident to $u$ differs from that for edges incident to $v$.
Cranston, Daniel W.
core +1 more source
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
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
, 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
Distance Magic Graphs - a Survey [PDF]
, 2011 Let <i>G = (V;E)</i> be a graph of order n. A bijection <i>f : V → {1, 2,...,n} </i>is called <i>a distance magic labeling </i>of G if there exists a positive integer k such that <i>Σ f(u) = k &
Arumugam, S. (S) +2 more
core