Results 11 to 20 of about 7,663 (277)
Properly even harmonious labelings of disconnected graphs
AKCE International Journal of Graphs and Combinatorics, 2015 A graph G with q edges is said to be harmonious if there is an injection f from the vertices of G to the group of integers modulo q such that when each edge xy is assigned the label f(x)+f(y)(modq), the resulting edge labels are distinct. If G is a tree,
Joseph A. Gallian, Danielle Stewart
doaj +3 more sources
Antimagic Labelings of Caterpillars [PDF]
Applied Mathematics and Computation, 2019 A $k$-antimagic labeling of a graph $G$ is an injection from $E(G)$ to $\{1,2,\dots,|E(G)|+k\}$ such that all vertex sums are pairwise distinct, where the vertex sum at vertex $u$ is the sum of the labels assigned to edges incident to $u$.
Lozano, Antoni +2 more
core +4 more sources
Even harmonious labelings of disjoint graphs with a small component
AKCE International Journal of Graphs and Combinatorics, 2015 A graph G with q edges is said to be harmonious if there is an injection f from the vertices of G to the group of integers modulo q such that when each edge xy is assigned the label f(x)+f(y)(modq), the resulting edge labels are distinct. If G is a tree,
Joseph A. Gallian, Danielle Stewart
doaj +3 more sources
Radio labelings of distance graphs [PDF]
Discrete Applied Mathematics, 2013 A radio $k$-labeling of a connected graph $G$ is an assignment $c$ of non negative integers to the vertices of $G$ such that $$|c(x) - c(y)| \geq k+1 - d(x,y),$$ for any two vertices $x$ and $y$, $x\ne y$, where $d(x,y)$ is the distance between $x$ and $y$ in $G$. In this paper, we study radio labelings of distance graphs, i.e., graphs with the set $\Z$
Čada, Roman +3 more
openaire +5 more sources
The Electronic Journal of Combinatorics, 2018 A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening 50 years nearly 200 graph labelings techniques have been studied in over 2000 papers. Finding out what has been done for any particular kind of labeling and keeping up
openaire +1 more source
Some New Results on Lucky Labeling
مجلة بغداد للعلوم, 2023 Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if for every pair ...
J. Ashwini +2 more
doaj +1 more source
Summarizing Labeled Multi-graphs
, 2023 17 pages, 8 figures, 4 ...
Berberidis, Dimitris +2 more
openaire +2 more sources
On Face Irregular Evaluations of Plane Graphs
Discussiones Mathematicae Graph Theory, 2022 We investigate face irregular labelings of plane graphs and we introduce new graph characteristics, namely face irregularity strength of type (α,β,γ). We obtain some estimation on these parameters and determine the precise values for certain families of ...
Bača Martin +3 more
doaj +1 more source
Perfect (super) Edge-Magic Crowns [PDF]
, 2017 A graph G is called edge-magic if there is a bijective function f from the set of vertices and edges to the set {1,2,…,|V(G)|+|E(G)|} such that the sum f(x)+f(xy)+f(y) for any xy in E(G) is constant. Such a function is called an edge-magic labelling of G
López Masip, Susana Clara +2 more
core +4 more sources
On labeled graph $C^*$-algebras
Rocky Mountain Journal of Mathematics, 2020 Given a directed graph $E$ and a labeling $\mathcal{L}$, one forms the labeled graph $C^*$-algebra by taking a weakly left--resolving labeled space $(E, \mathcal{L}, \mathcal{B})$ and considering a universal generating family of partial isometries and projections.
Banjade, Debendra P., Ephrem, Menassie
openaire +4 more sources