Results 21 to 30 of about 81 (79)
Applications of mathematical programming in graceful labeling of graphs
Journal of Applied Mathematics, Volume 2004, Issue 1, Page 1-8, 2004., 2004 Graceful labeling is one of the best known labeling methods of graphs. Despite the large number of papers published on the subject of graph labeling, there are few particular techniques to be used by researchers to gracefully label graphs. In this paper, first a new approach based on the mathematical programming technique is presented to model the ...
Kourosh Eshghi, Parham Azimi
wiley +1 more source
International Journal of Mathematics and Mathematical Sciences, Volume 29, Issue 8, Page 495-499, 2002., 2002 We construct a labeled graph D(n) that reflects the structure of divisors of a given natural number n. We define the concept of graceful numbers in terms of this associated graph and find the general form of such a number. As a consequence, we determine which graceful numbers are perfect.
Kiran R. Bhutani, Alexander B. Levin
wiley +1 more source
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
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
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 +2 more
doaj +1 more source
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 +5 more
doaj +1 more source
Radio Number Of Wheel Like Graphs
, 2011 In this paper we establish the radio number for Flower Wheel graph (F Wk n), k-Wheel graph (kW ) and Joint-Wheel graph(W Hn). AMS Subject classification: 05C78 (05C15)
A. A. Bhatti∗, Aster Nisar∗, Maria Kanwal∗ +1 more
core +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 +2 more
doaj +1 more source
Proof of a local antimagic conjecture [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 An antimagic labelling of a graph $G$ is a bijection $f:E(G)\to\{1,\ldots,E(G)\}$ such that the sums $S_v=\sum_{e\ni v}f(e)$ distinguish all vertices. A well-known conjecture of Hartsfield and Ringel (1994) is that every connected graph other than $K_2 ...
John Haslegrave
doaj +1 more source
AKCE International Journal of Graphs and Combinatorics, 2023 We introduce a concept in graph coloring motivated by the popular Sudoku puzzle. Let [Formula: see text] be a graph of order n with chromatic number [Formula: see text] and let [Formula: see text] Let [Formula: see text] be a k-coloring of the induced ...
J. Maria Jeyaseeli +3 more
doaj +1 more source