Results 21 to 30 of about 4,425 (218)
Improved Bounds for Relaxed Graceful Trees [PDF]
, 2016 We introduce left and right-layered trees as trees with a specific representation and define the excess of a tree. Applying these ideas, we show a range-relaxed graceful labeling which improves on the upper bound for maximum vertex label given by Van ...
Barrientos, Christian, Krop, Elliot
core +1 more source
Lucas Graceful Labeling for Some Graphs [PDF]
, 2011 By a graph, we mean a finite undirected graph without loops or multiple ...
Nagarajan, A. +2 more
core +1 more source
Alpha Labeling of Amalgamated Cycles
Theory and Applications of Graphs, 2022 A graceful labeling of a bipartite graph is an \a-labeling if it has the property that the labels assigned to the vertices of one stable set of the graph are smaller than the labels assigned to the vertices of the other stable set.
Christian Barrientos
doaj +1 more source
Edge-Graceful Labelings of Connected Graphs
Electronic Notes in Discrete Mathematics, 2016 Abstract Let G be a connected edge-graceful ( p , q ) -graph with q = k p + r , where k is an integer and 0 ≤ r p . In this paper, we prove that every edge-graceful labeling f of G induces [ ( k + 1 ) ! ] r [ k ! ] p − r number of edge-graceful labelings of G.
K. Kayathri, R. Amutha
openaire +1 more source
Directed Edge - Graceful Labeling of Cycle and Star Related Graphs
International Journal of Mathematics and Soft Computing, 2011 Rosa [13] introduced the notion of graceful labelings. The concept of magic, antimagic and conservative labelings have been extended to directed graphs [11]. Bloom and Hsu [3, 4, 5] extended the notion of graceful labeling to directed graphs. In 1985, Lo [12] introduced the notion of edge – graceful graphs. We introduced [8] the concept of edge
B. Gayathri, V. Vanitha
openaire +1 more source
Odd Harmonious Labeling of Some Graphs [PDF]
, 2012 The labeling of discrete structures is a potential area of research due to its wide range of applications.
Shah, N.H., Vaidya, S.K.
core +1 more source
, 2020 A graceful labeling of a graph $G$ with $m$ edges consists of labeling the vertices of $G$ with distinct integers from $0$ to $m$ such that, when each edge is assigned as induced label the absolute difference of the labels of its endpoints, all induced ...
Dantas, Simone +2 more
core +2 more sources
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
Further results on super graceful labeling of graphs
AKCE International Journal of Graphs and Combinatorics, 2016 Let G=(V(G),E(G)) be a simple, finite and undirected graph of order p and size q. A bijection f:V(G)∪E(G)→{k,k+1,k+2,…,k+p+q−1} such that f(uv)=|f(u)−f(v)| for every edge uv∈E(G) is said to be a k-super graceful labeling of G.
Gee-Choon Lau, Wai Chee Shiu, Ho-Kuen Ng
doaj +1 more source
Theory and Applications of Graphs, 2020 In his classical paper [14], Rosa introduced a hierarchical series of labelings called ρ, σ, β and α labeling as a tool to settle Ringel’s Conjecture which states that if T is any tree with m edges then the complete graph K2m+1 can be decomposed into 2m +
G. Sethuraman, M. Sujasree
doaj +1 more source