Results 1 to 10 of about 1,632,039 (225)
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 +6 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
doaj +4 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
doaj +4 more sources
A new class of graceful graphs: k-enriched fan graphs and their characterisations
Cubo, 2021 The Graceful Tree Conjecture stated by Rosa in the mid 1960s says that every tree can be gracefully labelled. It is one of the best known open problems in Graph Theory.
M. Haviar, S. Kurtulík
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
Edge even and edge odd graceful labelings of Paley Graphs
Journal of Physics: Conference Series, 2021 Edge even graceful labeling is a novel graceful labelling, introduced in 2017 by Elsonbaty and Daoud. A graph G with p vertices and q edges is called an edge even graceful if there is a bijection f: E(G) → {2, 4,. .
T. Kamaraj, J Thangakani
openalex +2 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
International Journal of Mathematics And Computer ResearchThe concept of graph labeling was introduced in mid-1960 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 pair of ...
A. N. Bhavale, Deepak S. Shelke
openalex +3 more sources
Characterizations of kites as graceful graphs
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
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
openalex +3 more sources