Results 61 to 70 of about 533 (83)
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
Note on group irregularity strength of disconnected graphs
Open Mathematics, 2018 We investigate the group irregularity strength (sg(G)) of graphs, i.e. the smallest value of s such that taking any Abelian group 𝓖 of order s, there exists a function f : E(G) → 𝓖 such that the sums of edge labels at every vertex are distinct. So far it
Anholcer Marcin +3 more
doaj +1 more source
On Integer Additive Set-Indexers of Graphs [PDF]
, 2014 A set-indexer of a graph $G$ is an injective set-valued function $f:V(G) \rightarrow2^{X}$ such that the function $f^{\oplus}:E(G)\rightarrow2^{X}-\{\emptyset\}$ defined by $f^{\oplus}(uv) = f(u){\oplus} f(v)$ for every $uv{\in} E(G)$ is also injective ...
Germina, K. A., Sudev, N. K.
core +2 more sources
Total weight choosability in Hypergraphs [PDF]
, 2013 A total weighting of the vertices and edges of a hypergraph is called vertex-coloring if the total weights of the vertices yield a proper coloring of the graph, i.e., every edge contains at least two vertices with different weighted degrees. In this note
Pfender, Florian
core
Lobsters with an almost perfect matching are graceful [PDF]
, 2014 Let $T$ be a lobster with a matching that covers all but one vertex.
Krop, Elliot
core
On alpha labeling of tensor product of paths and cycles. [PDF]
Heliyon, 2023 L U, G R.
europepmc +1 more source
4−Equitable Tree Labelings [PDF]
, 2017 We assign the labels {0,1,2,3} to the vertices of a graph; each edge is assigned the absolute difference of the incident vertices’ labels. For the labeling to be 4−equitable, we require the edge labels and vertex labels to each be distributed as ...
Coles, Zena +3 more
core +2 more sources
Zero-sum partitions of Abelian groups and their applications to magic- and antimagic-type labelings [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe following problem has been known since the 80s. Let $\Gamma$ be an Abelian group of order $m$ (denoted $|\Gamma|=m$), and let $t$ and $\{m_i\}_{i=1}^{t}$, be positive integers such that $\sum_{i=1}^t m_i=m-1$. Determine when $\Gamma^*=\Gamma\setminus\
Sylwia Cichacz, Karol Suchan
doaj +1 more source
Caterpillars Have Antimagic Orientations
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2018 An antimagic labeling of a directed graph D with m arcs is a bijection from the set of arcs of D to {1, …, m} such that all oriented vertex sums of vertices in D are pairwise distinct, where the oriented vertex sum of a vertex u is the sum of labels of ...
Lozano Antoni
doaj +1 more source
Forum of Mathematics, SigmaThe present paper explores a connection between two concepts arising from different fields of mathematics. The first concept, called vine, is a graphical model for dependent random variables.
Hung Manh Tran +2 more
doaj +1 more source