Results 1 to 10 of about 5,041 (197)

Computer search for graceful labeling: a survey [PDF]

Electronic Journal of Graph Theory and Applications, 2022
Summary: This paper surveys the main computer search results for finding graceful labeling of trees. The paper is devoted to the memory of Mirka Miller, who made an outstanding contribution to the area of graph labeling.
Ljiljana Branković, Michael J. Reynolds
openalex   +3 more sources

Radio Graceful Labelling of Graphs

Theory and Applications of Graphs, 2020
Radio labelling problem of graphs have their roots in communication problem known as \emph{Channel Assignment Problem}. For a simple connected graph $G=(V(G), E(G))$, a radio labeling is a mapping $f \colon V(G)\rightarrow \{0,1,2,\ldots\}$ such that $|f(
Laxman Saha, Alamgir Basunia
doaj   +5 more sources

Addendum for the article Radio Graceful Labelling of Graphs

Theory and Applications of Graphs, 2020
Additional references listed for the article: Saha, Laxman and Basunia, Alamgir Rahaman (2020) "Radio Graceful Labelling of Graphs," Theory and Applications of Graphs: Vol. 7: Iss. 1, Article 7.
Laxman Saha, Alamgir Basunia
doaj   +3 more sources

Edge even graceful labelling of some book graphs

Journal of Taibah University for Science, 2018
Elsonbaty and Daoud introduced a new type of labelling of a graph G with p vertices and q edges called an edge even graceful labelling if there is a bijection f from the edges of the graph to the set $\{2, 4,\ldots , 2q\}$ such that, when each vertex is ...
S N Daoud, Ahmed N Elsawy
exaly   +2 more sources

Edge even graceful labelling of new families of graphs

Journal of Taibah University for Science, 2019
Elsonbaty and Daoud introduced a new type of labelling of a graph G with p vertices and q edges called an edge even graceful labelling. A graph G is called edge even graceful if there is a bijection $f: E(G) \rightarrow \{2, 4,\ldots , 2q\} $ such that ...
S N Daoud, Ahmed N Elsawy
exaly   +2 more sources

Graceful labeling of posets

Annals of Mathematics and Physics
Abstract The concept of graph labeling was introduced in the mid-1960s by Rosa. In this paper, we introduce a notion of graceful labeling of a finite poset. We obtain graceful labeling of some postes such as a chain, a fence, and a crown. In 2002 Thakare, Pawar, and Waphare introduced the `adjunct' operation of two lattices with respect to an adjunct ...
A. N. Bhavale, Deepak S. Shelke
  +5 more sources

ON k-GRACEFUL LABELING OF SOME GRAPHS

Journal of applied mathematics & informatics, 2016
Summary: In this paper, it has been shown that the hairy cycle \(C_{n}\odot rK_{1},\) \(n\equiv 3\pmod 4\), the graph obtained by adding pendant edge to each pendant vertex of hairy cycle \(C_{n}\odot 1K_{1}\), \(n\equiv 0\pmod 4\), double graph of path \(P_{n}\) and double graph of comb \(P_{n}\odot 1K_{1}\) are \(k\)-graceful.
Priodyuti Pradhan, Kamesh Kumar
openalex   +4 more sources

Graceful labelling of the union of paths and cycles

Discrete Mathematics, 1999
The authors show that \(C_5\cup P_n\) is graceful and \(C_s\cup P_n\) is graceful for every \(s\geq 5\) when \(n\geq (s+ 5)/2\). This result is another step towards settling the conjecture that \(C_s\cup P_n\) is graceful whenever \(n+ s\geq 7\).
Sheshayya A. Choudum, S. Pitchai Muthu Kishore   +1 more
exaly   +3 more sources

On Locally Monotone Graceful Labelings

In previous versions some translations were missed and incorrect.
Igor Blokhin
openalex   +2 more sources

Lucas Graceful Labeling For Some Graphs

, 2011
By a graph, we mean a finite undirected graph without loops or multiple edges.
S. Navaneethakrishnan, Perumal Perumal, A. Nagarajan   +2 more
openalex   +4 more sources