Results 61 to 70 of about 532 (81)

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

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  

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

Further Studies on the Sparing Number of Graphs [PDF]

, 2014
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 is an injective function $f:V(G)\to \mathcal{P}(\mathbb{N}_0)$ such that the induced function $f^+:E(G) \to ...
Germina, K A, Sudev, N K
core   +2 more sources

Zero-sum partitions of Abelian groups and their applications to magic- and antimagic-type labelings [PDF]

Discrete Mathematics & Theoretical Computer Science
The 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

On alpha labeling of tensor product of paths and cycles. [PDF]

Heliyon, 2023
L U, G R.
europepmc   +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

Vines and MAT-labeled graphs

Forum of Mathematics, Sigma
The 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, Tan Nhat Tran, Shuhei Tsujie   +2 more
doaj   +1 more source

Optimal L(3,2,1)-labeling of trees

AKCE International Journal of Graphs and Combinatorics
Given a graph G, an [Formula: see text]-labeling of G is an assignment f of non-negative integers (labels) to the vertices of G such that [Formula: see text] if [Formula: see text] (i = 1, 2, 3).
Xiaoling Zhang
doaj   +1 more source

On the Beta-Number of Forests with Isomorphic Components

Discussiones Mathematicae Graph Theory, 2018
The beta-number, β (G), of a graph G is defined to be either the smallest positive integer n for which there exists an injective function f : V (G) → {0, 1, . . .
Ichishima Rikio, López Susana-Clara, Muntaner-Batle Francesc Antoni, Oshima Akito   +3 more
doaj   +1 more source