Results 11 to 20 of about 103,423 (250)
Radio Graceful Labelling of Graphs [PDF]
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 +6 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 ...
Ahmed N Elsawy, S N Daoud
exaly +3 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 ...
Ahmed N Elsawy, S N Daoud
exaly +3 more sources
Addendum for the article Radio Graceful Labelling of Graphs [PDF]
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 +2 more sources
PELABELAN ODD-GRACEFUL PADA GRAF PRODUK SISIR
Majalah Ilmiah Matematika dan Statistika, 2022 Gnanajothi defined a graph with edges to be odd-graceful if there is an injective function such that if every edge is labelled with the resulting edge labels are . She proved that the graph obtained by joining one pendant to every vertex in is odd-
Juan Daniel +3 more
doaj +2 more sources
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 Brankovic, Michael J. Reynolds
openaire +4 more sources
Relaxed Graceful Labellings of Trees [PDF]
The Electronic Journal of Combinatorics, 2002 A graph $G$ on $m$ edges is considered graceful if there is a labelling $f$ of the vertices of $G$ with distinct integers in the set $\{0,1,\dots,m\}$ such that the induced edge labelling $g$ defined by $g(uv)=|f(u)-f(v)|$ is a bijection to $\{1,\dots,m\}$. We here consider some relaxations of these conditions as applied to tree labellings: 1.
Frank Van Bussel
openaire +4 more sources
Characterizations of kites as graceful graphs [PDF]
CuboWe introduce and study an infinite family of graceful graphs, which we call kites. The kites are graphs where a path is joined with a graph "forming" a kite.
Miroslav Haviar, Katarina Kotuľová
doaj +2 more sources
Graceful labellings of paths [PDF]
Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cattell, Rohan
openaire +2 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\).
S A Choudum
exaly +3 more sources