Results 11 to 20 of about 1,632,039 (225)
A Class of Trees Having Strongly Super Total Graceful Labellings [PDF]
, 2017 Rosa[1], in 1976, introduced the concept of β-labeling of a simple, finite, connected and undir ected graph. The graceful labeling was introduced in attacking famous Ringel's conjecture: A complete graph K2n+1 can be decomposed into 2n+1 subgraphs that ...
Zhao Xiyang +3 more
openalex +2 more sources
Application of odd hexagonal graceful labeling in cryptography [PDF]
International Journal of Advanced Academic StudiesCryptography is regarded as a scientific discipline that achieves security by converting sensitive information into an unintelligible form that cannot be interpreted by anybody other than the transmitter and intended recipient.
Asha S, V Akshaya
openalex +2 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
Lucas Graceful Labeling For Some Graphs
, 2011 By a graph, we mean a finite undirected graph without loops or multiple edges.
S. Navaneethakrishnan +2 more
openalex +3 more sources
m-Bonacci graceful labeling [PDF]
AKCE International Journal of Graphs and Combinatorics, 2021 We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci graceful if the vertices can be labeled with distinct integers from the set such that the derived edge labels are the first n m-bonacci numbers. We show that complete graphs, complete bipartite graphs, gear graphs, triangular grid graphs, and wheel graphs ...
Kalpana Mahalingam +1 more
openaire +2 more sources
E-super arithmetic graceful labelling of Hi(m, m), Hi(1) (m, m) and chain of even cycles
Acta Universitatis Sapientiae: Informatica, 2023 E-super arithmetic graceful labelling of a graph G is a bijection f from the union of the vertex set and edge set to the set of positive integers (1, 2, 3, … |V(G) ∪ E(G)|) such that the edges have the labels from the set {1, 2, 3, …, |E(G)|} and the ...
S. Anubala, V. Ramachandran
semanticscholar +1 more source
Variations of graceful labelling of subgraph of millipede graph
THE 2ND UNIVERSITAS LAMPUNG INTERNATIONAL CONFERENCE ON SCIENCE, TECHNOLOGY, AND ENVIRONMENT (ULICoSTE) 2021, 2022 . In graph theory, there is the topics name by labelling. In 1967, Alex Rosa introduced the theory of labelling. Furthermore, Alex Rosa initiate the 𝛽 -labelling known as the graceful labelling that Golomb introduced.
D. E. Nurvazly +2 more
semanticscholar +1 more source
A Study on Characteristics of the Graceful Labelling
Shanlax International Journal of Arts, Science and Humanities, 2022 The origin of graph theory can be traced back to the work of the Swiss mathematician Leonard Euler (1707-1783) who in 1735 solved a problem that came to be known as the ‘Seven Bridges of Konigsberg’ [21].
K. Deepa, Dr.L. Anitha
semanticscholar +1 more source
Exploring Relationship Between Traditional Lattices and Graph Lattices of Topological Coding
Jisuanji kexue yu tansuo, 2021 It is known that there are no polynomial quantum algorithms to solve some lattice difficult problems. Uncolored graphic lattice and colored graphic lattice are the products of multidisciplinary intersection inspired by lattice theory. A uncolored graphic
ZHANG Mingjun, YANG Sihua, YAO Bing
doaj +1 more source
A Study of Independency on Fuzzy Resolving Sets of Labelling Graphs
Mathematics, 2023 Considering a fuzzy graph G is simple and can be connected and considered as a subset H=u1,σu1,u2,σu2,…uk,σuk, |H|≥2; then, every two pairs of elements of σ−H have a unique depiction with the relation of H, and H can be termed as a fuzzy resolving set ...
Ramachandramoorthi Shanmugapriya +3 more
doaj +1 more source