Results 21 to 30 of about 533 (83)
On Local Antimagic Chromatic Number of Cycle-Related Join Graphs
Discussiones Mathematicae Graph Theory, 2021 An edge labeling of a connected graph G = (V, E) is said to be local antimagic if it is a bijection f : E → {1, . . ., |E|} such that for any pair of adjacent vertices x and y, f+(x) ≠ f+(y), where the induced vertex label f+(x) = Σf(e), with e ranging ...
Lau Gee-Choon, Shiu Wai-Chee, Ng Ho-Kuen
doaj +1 more source
, 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 +4 more
core +1 more source
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
Super Fibonacci Graceful Labeling of Some Special Class of Graphs [PDF]
, 2011 A Fibonacci graceful labeling and a super Fibonacci graceful labeling on graphs were introduced by Kathiresan and Amutha in ...
Nagarajan, K. +2 more
core +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
A simplified implementation of the least squares solution for pairwise comparisons matrices [PDF]
, 2011 This is a follow up to "Solution of the least squares method problem of pairwise comparisons matrix" by Bozóki published by this journal in 2008. Familiarity with this paper is essential and assumed.
LS Lasdon +7 more
core +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