Results 31 to 40 of about 532 (81)
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
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
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
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
Journal of Applied Mathematics, Volume 2025, Issue 1, 2025.This article explores numerous significant additive topological indices based on degrees for linear functional graphs over finite‐dimensional vector spaces. Specifically, we derive some unique topological indices, such as the eccentricity‐based indices and the Wiener index.
Vinnarasi L. +4 more
wiley +1 more source
On the Sparing Number of the Edge-Corona of Graphs
, 2015 Let $\mathbb{N}_0$ be the set of all non-negative integers and $\mathcal{P}(\mathbb{N}_0)$ be its the power set. An integer additive set-indexer (IASI) of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(\mathbb{N}_0)$ such that the induced ...
Chithra, K. P. +2 more
core +2 more sources
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 +2 more
core +2 more sources
Sharp bounds for partition dimension of generalized Möbius ladders
Open Mathematics, 2018 The concept of minimal resolving partition and resolving set plays a pivotal role in diverse areas such as robot navigation, networking, optimization, mastermind games and coin weighing.
Hussain Zafar +4 more
doaj +1 more source
Cyclic Cordial Labeling for the Lemniscate Graphs and Their Second Powers
Journal of Mathematics, Volume 2025, Issue 1, 2025.A lemniscate graph, usually denoted by Ln,m, is defined as a union of two cycles Cn and Cm that share a common vertex. A simple graph is called cyclic group cordial if we can provide a three elements’ cyclic group labeling satisfying certain conditions.
M. A. AbdAllah +4 more
wiley +1 more source