Results 241 to 250 of about 6,739 (277)

Modeling the neurocognitive dynamics of language across the lifespan. [PDF]

Hum Brain Mapp
Guichet C, Banjac S, Achard S, Mermillod M, Baciu M.   +4 more
europepmc   +1 more source

Dynamic graph neural networks for UAV-based group activity recognition in structured team sports. [PDF]

Front Neurorobot
Zahra I, Wu Y, Alhasson HF, Alharbi SS, Aljuaid H, Jalal A, Liu H.   +6 more
europepmc   +1 more source

A Survey on Data-Driven Approaches for Reliability, Robustness, and Energy Efficiency in Wireless Body Area Networks. [PDF]

Sensors (Basel)
Majumdar P, Roy S, Sikdar S, Ghosh P, Ghosh N.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On Farey Graceful Labeling

The National Academy of Sciences, India, 2023
Ajay Kumar, Debdas Mishra, V. K. Srivastava   +2 more
exaly   +2 more sources

Graceful Cascading Labelling Algorithm: Construction of Graceful Labelling of Trees

2021 2nd International Conference on Robotics, Electrical and Signal Processing Techniques (ICREST), 2021
The Graceful Labelling of trees is one of the most challenging conjectures in Graph Theory, proudly known as the 'Disease' of Graph Theory which remains a challenge as it remains unsolved. To counter the conjecture, an algorithm is proposed to construct a Graceful Binary Tree and a Graceful Caterpillar Tree.
Dipta Gomes, Md. Manzurul Hasan
openaire   +1 more source

ODD GRACEFUL LABELINGS OF GRAPHS

Discrete Mathematics, Algorithms and Applications, 2009
A graph G = (V(G), E(G)) with q edges is said to be odd graceful if there exists an injection f from V(G) to {0, 1, 2, …, 2q - 1} such that the edge labeling set is {1, 3, 5, …, 2q - 1} with each edge xy assigned the label |f(x) - f(y)|. In this paper, we prove that Pn × Pm (m = 2, 3, 4), generalized crown graphs Cn ⊙ K1,t and gear graphs are odd ...
Zhen-Bin Gao, Xiao-Dong Zhang 0001, Lijuan Xu   +2 more
openaire   +1 more source

On Graceful Labelings of Trees

2011
A tree is a connected acyclic graph. A tree of n vertices is said to be graceful if the vertices can be assigned the labels {0, 1, 2, ..., n - 1} such that the absolute value of the differences in vertex labels between neighboring vertices generate the set consisting distinct values {1, 2, 3, ...,n-1}.
Sourabh Aryabhatta, Tonmoy Guha Roy, Md. Mohsin Uddin, Md. Saidur Rahman   +3 more
openaire   +1 more source

The Generation of k-Graceful Figure and Graceful Label

2014 Fourth International Conference on Instrumentation and Measurement, Computer, Communication and Control, 2014
This paper introduces the concept of graceful figure, discusses a special kind of graceful figure: K-graceful figure, draw all the graceful figure of the generated by the n side of all the beautiful label generation algorithm. The algebraic theory and computer tools introduced a graceful figure.
Jia Peipei, Zhang Tai, Zhang Yuanyuan
openaire   +1 more source

Graceful Labelings of Nearly Complete Graphs

Results in Mathematics, 2002
A graph with \(q\) edges is graceful, if we can assign to each vertex an integer in \(\{0, 1, \ldots, q\}\), such that all edges have a different value of the absolute difference of the labels of its endpoints. This paper investigates which graphs that are `nearly complete', or a complete multipartite graph, are graceful.
Beutner, Detlev, Harborth, Heiko
openaire   +1 more source

Graceful labeling based En (Grace) cryption and De (Grace) cryption

2013 IEEE International Conference ON Emerging Trends in Computing, Communication and Nanotechnology (ICECCN), 2013
In recent years, Encryption has fascinated extra responsiveness owing to the swift development in multimedia and network technologies where the data has to be shielded from unauthorized access. Image scrambling scheme provide protection for digital images.
P. Mithun, N. R. Raajan
openaire   +1 more source