Results 31 to 40 of about 547 (79)
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
On the metric dimension of strongly annihilating-ideal graphs of commutative rings
Acta Universitatis Sapientiae: Mathematica, 2020 Let be a commutative ring with identity and 𝒜() be the set of ideals with non-zero annihilator. The strongly annihilating-ideal graph of is defined as the graph SAG() with the vertex set 𝒜 ()* = 𝒜 () \{0} and two distinct vertices I and J are ...
Soleymanivarniab V. +2 more
doaj +1 more source
Associated Graphs of Certain Arithmetic IASI Graphs [PDF]
, 2014 An integer additive set-indexer is defined as an injective function $f:V(G)\rightarrow 2^{\mathbb{N}_0}$ such that the induced function $f^+:E(G) \rightarrow 2^{\mathbb{N}_0}$ defined by $f^+ (uv) = f(u)+ f(v)$ is also injective. A graph $G$ which admits
Germina, K. A., Sudev, N. K.
core +3 more sources
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
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
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
, 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
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
Total weight choosability in Hypergraphs [PDF]
, 2013 A total weighting of the vertices and edges of a hypergraph is called vertex-coloring if the total weights of the vertices yield a proper coloring of the graph, i.e., every edge contains at least two vertices with different weighted degrees. In this note
Pfender, Florian
core
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