Results 61 to 70 of about 746 (100)
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
Weak Integer Additive Set-Indexers of Certain Graph Products [PDF]
, 2014 An integer additive set-indexer is defined as an injective function $f:V(G)\rightarrow 2^{\mathbb{N}_0}$ such that the induced function $g_f:E(G) \rightarrow 2^{\mathbb{N}_0}$ defined by $g_f (uv) = f(u)+ f(v)$ is also injective, where $f(u)+f(v)$ is the
Germina, K A, Sudev, N K
core +2 more sources
A Note on the Sparing Number of the Sieve Graphs of Certain Graphs [PDF]
, 2015 Let $\mathbb{N}_0$ denote the set of all non-negative integers and $\mathcal{P}(\mathbb{N}_0)$ be its power set. An integer additive set-indexer (IASI) of a given graph $G$ is an injective function $f:V(G)\to \mathcal{P}(\mathbb{N}_0)$ such that the ...
Germina, Augustine, Sudev, Naduvath
core +2 more sources
Pair L(2, 1)-Labelings of Infinite Graphs
Discussiones Mathematicae Graph Theory, 2019 An L(2, 1)-labeling of a graph G = (V,E) is an assignment of nonnegative integers to V such that two adjacent vertices must receive numbers (labels) at least two apart and further, if two vertices are in distance 2 then they receive distinct labels. This
Yeh Roger K.
doaj +1 more source
Computing the total H-irregularity strength of edge comb product of graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2023 A simple undirected graph = (V Γ, EΓ) admits an H-covering if every edge in E belongs to at least one subgraph of that is isomorphic to a graph H. For any graph admitting H-covering, a total labelling β : VΓ ∪EΓ→{1, 2, …, p} is called an H-irregular ...
Wahyujati Mohamad Fahruli, Susanti Yeni
doaj +1 more source
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
A rainbow blow-up lemma for almost optimally bounded edge-colourings
Forum of Mathematics, Sigma, 2020 A subgraph of an edge-coloured graph is called rainbow if all its edges have different colours. We prove a rainbow version of the blow-up lemma of Komlós, Sárközy, and Szemerédi that applies to almost optimally bounded colourings.
Stefan Ehard, Stefan Glock, Felix Joos
doaj +1 more source
1-Restricted Optimal Rubbling on Graphs
Discussiones Mathematicae Graph Theory, 2019 Let G be a graph with vertex set V and a distribution of pebbles on the vertices of V. A pebbling move consists of removing two pebbles from a vertex and placing one pebble on a neighboring vertex, and a rubbling move consists of removing a pebble from ...
Beeler Robert A. +2 more
doaj +1 more source
A Study on Edge-Set Graphs of Certain Graphs
, 2015 Let $G(V, E)$ be a simple connected graph, with $|E| = \epsilon.$ In this paper, we define an edge-set graph $\mathcal G_G$ constructed from the graph $G$ such that any vertex $v_{s,i}$ of $\mathcal G_G$ corresponds to the $i$-th $s$-element subset of $E(
Chithra, K. P., Kok, Johan, Sudev, N. K.
core +2 more sources
L(2, 1)-Labeling of Circulant Graphs
Discussiones Mathematicae Graph Theory, 2019 An L(2, 1)-labeling of a graph Γ is an assignment of non-negative integers to the vertices such that adjacent vertices receive labels that differ by at least 2, and those at a distance of two receive labels that differ by at least one.
Mitra Sarbari, Bhoumik Soumya
doaj +1 more source