Results 71 to 80 of about 1,270,493 (107)
World Congress on Osteoporosis, Osteoarthritis and Musculoskeletal Diseases (WCO-IOF-ESCEO 2020): Poster Abstracts. [PDF]
Osteoporos Int, 2020 europepmc +1 more source
Strong k - edge odd Graceful labeling of graphs
International Mathematical Forum, 2018 openaire +1 more source
From Modality Performance to Graceful Degradation: A PRISMA 2020 Systematic Review of Sensor Architectures for Autonomous Vehicles. [PDF]
Sensors (Basel)Viktor P.
europepmc +1 more source
Graceful Labeling of Spider Graphs With at Most Five Legs
A graceful labeling of a graph G with q edges is an injection f from the vertices of G to the set 0,1,⋯,q such that, when each edge uv is assigned the label fu−fv, the resulting edge labels are distinct.
A. Panpa, T. Wasuanankul, S. Imnang
core +1 more source
HyMSS-GAD: a hybrid multi-stage framework for multi-view graph anomaly detection with structural, contextual, and geometric reasoning. [PDF]
Sci RepKhan W, Ebrahim N, Elloumi M, Brahim K.
europepmc +1 more source
, 2006 Graceful labeling was first introduced by Rosa in 1966. A vertex labeling of a graph G is an assignment f of labels to the vertices of G that induces for each edge xy a label depending on the vertex labels f(x) and f(y).
core
On growth and form of animal behavior. [PDF]
Front Integr NeurosciGolani I, Kafkafi N.
europepmc +1 more source
Super Fibonacci Graceful Labeling
, 2014 : A Smarandache-Fibonacci Triple is a sequence S(n), n ≥ 0 such that S(n) = S(n−1)+S(n−2), where S(n) is the Smarandache function for integers n ≥ 0. Certainly, it is a generalization of Fibonacci sequence.
S. Navaneethakrishnan +2 more
core
Towards the Graceful Tree Conjecture: A Survey
A graceful labelling of an undirected graph G with n edges is a one-to-one function from the set of vertices of G to the set {0, 1, 2,...,n} such that the induced edge labels are all distinct. An induced edge label is the absolute value of the difference
Brankovic, Ljiljana +3 more
core