Results 21 to 30 of about 746 (100)

On the edge-balanced index sets of product graphs [PDF]

open access: yes, 2011
We characterize strongly edge regular product graphs and find the edge-balanced index sets of complete bipartite graphs without a perfect matching, the direct product $K_n\times K_2$.
Krop, Elliot   +2 more
core   +2 more sources

Zero-sum partitions of Abelian groups of order $2^n$ [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2023
The following problem has been known since the 80's. Let $\Gamma$ be an Abelian group of order $m$ (denoted $|\Gamma|=m$), and let $t$ and $m_i$, $1 \leq i \leq t$, be positive integers such that $\sum_{i=1}^t m_i=m-1$.
Sylwia Cichacz, Karol Suchan
doaj   +1 more source

On Local Antimagic Chromatic Number of Cycle-Related Join Graphs

open access: yesDiscussiones 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

Additive List Coloring of Planar Graphs with Given Girth

open access: yesDiscussiones Mathematicae Graph Theory, 2020
An additive coloring of a graph G is a labeling of the vertices of G from {1, 2, . . . , k} such that two adjacent vertices have distinct sums of labels on their neighbors.
Brandt Axel   +2 more
doaj   +1 more source

Extension of α‐labelings of quadratic graphs

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 11, Page 571-578, 2004., 2004
First, a new proof for the existence of an α‐labeling of the quadratic graph Q(3, 4k) is presented. Then the existence of α‐labelings of special classes of quadratic graphs with some isomorphic components is shown.
Kourosh Eshghi
wiley   +1 more source

Super Fibonacci Graceful Labeling of Some Special Class of Graphs [PDF]

open access: yes, 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

Bounds of Strong EMT Strength for certain Subdivision of Star and Bistar

open access: yesOpen Mathematics, 2018
A super edge-magic total (SEMT) labeling of a graph ℘(V, E) is a one-one map ϒ from V(℘)∪E(℘) onto {1, 2,…,|V (℘)∪E(℘) |} such that ∃ a constant “a” satisfying ϒ(υ) + ϒ(υν) + ϒ(ν) = a, for each edge υν ∈E(℘), moreover all vertices must receive the ...
Kanwal Salma   +5 more
doaj   +1 more source

Applications of mathematical programming in graceful labeling of graphs

open access: yesJournal 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

Graceful numbers

open access: yesInternational 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

Antimagic Labelings of Weighted and Oriented Graphs [PDF]

open access: yes, 2019
A graph $G$ is $k$-$weighted-list-antimagic$ if for any vertex weighting $\omega\colon V(G)\to\mathbb{R}$ and any list assignment $L\colon E(G)\to2^{\mathbb{R}}$ with $|L(e)|\geq |E(G)|+k$ there exists an edge labeling $f$ such that $f(e)\in L(e)$ for ...
Berikkyzy, Zhanar   +4 more
core   +3 more sources

Home - About - Disclaimer - Privacy