Results 31 to 40 of about 746 (100)

Supermagic Generalized Double Graphs 1

Discussiones Mathematicae Graph Theory, 2016
A graph G is called supermagic if it admits a labelling of the edges by pairwise di erent consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex.
Ivančo Jaroslav
doaj   +1 more source

Strong Integer Additive Set-valued Graphs: A Creative Review [PDF]

, 2015
For a non-empty ground set $X$, finite or infinite, the {\em set-valuation} or {\em set-labeling} of a given graph $G$ is an injective function $f:V(G) \to \mathcal{P}(X)$, where $\mathcal{P}(X)$ is the power set of the set $X$. A set-indexer of a graph $
K. A. Germina, K. P. Chithra, N. K. Sudev, Naduvath Mana Nandikkara   +3 more
core   +1 more source

Constant Sum Partition of Sets of Integers and Distance Magic Graphs

Discussiones Mathematicae Graph Theory, 2018
Let A = {1, 2, . . . , tm+tn}. We shall say that A has the (m, n, t)-balanced constant-sum-partition property ((m, n, t)-BCSP-property) if there exists a partition of A into 2t pairwise disjoint subsets A1, A2, . . . , At, B1, B2, . . .
Cichacz Sylwia, Gőrlich Agnieszka
doaj   +1 more source

A Study on Set-Graphs [PDF]

, 2015
A \textit{primitive hole} of a graph $G$ is a cycle of length $3$ in $G$. The number of primitive holes in a given graph $G$ is called the primitive hole number of that graph $G$. The primitive degree of a vertex $v$ of a given graph $G$ is the number of
C. Susanth, Johan Kok, K. P. Chithra, N. K. Sudev, Naduvath Mana Nandikkara   +4 more
core   +1 more source

Power domination in Mycielskian of spiders

AKCE International Journal of Graphs and Combinatorics, 2022
The power domination problem in graphs consists of finding a minimum set of vertices [Formula: see text] that monitors the entire graph G governed by two ‘monitoring rules’- domination and propagation. A set [Formula: see text] is a power dominating set (
Seema Varghese, Seethu Varghese, Ambat Vijayakumar   +2 more
doaj   +1 more source

Super ( a , d ) - C_4 -antimagicness of book graphs

, 2018
Let G = (V,E) be a finite simple graph with |V (G)| vertices and |E(G)| edges. An edge-covering of G is a family of subgraphs H1, H2, . . . , Ht such that each edge of E(G) belongs to at least one of the subgraphs Hi, i = 1, 2, . . . , t.
M. Umar, M. A. Javed, Mujtaba Hussain, Basharat Rehman Ali   +3 more
semanticscholar   +1 more source

Graceful Labeling of Posets

Annals of Mathematics and Physics
The concept of graph labeling was introduced in the mid-1960s by Rosa. In this paper, we introduce a notion of graceful labeling of a finite poset. We obtain graceful labeling of some postes such as a chain, a fence, and a crown.
Bhavale An, Shelke Ds
semanticscholar   +1 more source

Deficiency of forests

Open Mathematics, 2017
An edge-magic total labeling of an (n,m)-graph G = (V,E) is a one to one map λ from V(G) ∪ E(G) onto the integers {1,2,…,n + m} with the property that there exists an integer constant c such that λ(x) + λ(y) + λ(xy) = c for any xy ∈ E(G).
Javed Sana, Hussain Mujtaba, Riasat Ayesha, Kanwal Salma, Imtiaz Mariam, Ahmad M. O.   +5 more
doaj   +1 more source

Two extensions of Leech labeling to the class of all graphs

AKCE International Journal of Graphs and Combinatorics, 2022
Let [Formula: see text] be a tree of order n and let [Formula: see text] be an injective edge labeling of T. The weight of a path P is the sum of the labels of the edges of P and is denoted by [Formula: see text] If the set of weights of the [Formula ...
Seena Varghese, Aparna Lakshmanan S., S. Arumugam   +2 more
doaj   +1 more source

All trees are six-cordial [PDF]

, 2017
For any integer $k>0$, a tree $T$ is $k$-cordial if there exists a labeling of the vertices of $T$ by $\mathbb{Z}_k$, inducing a labeling on the edges with edge-weights found by summing the labels on vertices incident to a given edge modulo $k$ so that ...
Driscoll, Keith, Krop, Elliot, Nguyen, Michelle   +2 more
core   +2 more sources