Results 61 to 70 of about 219,967 (286)
Science and Technology IndonesiaA fundamental area of graph theory, graph labeling concerns the assignment of integers to the vertices, edges, or both of a graph under specified constraints. One of the many types of graph labeling is edge-graceful labeling.
John Rafael M. Antalan +3 more
doaj +1 more source
Journal of Mathematics, 2023 In this article, we adapt the edge-graceful graph labeling definition into block designs and define a block design V,B with V=v and B=b as block-graceful if there exists a bijection f:B⟶1,2,…,b such that the induced mapping f+:V⟶Zv given by f+x=∑x∈AA ...
Dilara Erdemir, Emre Kolotoğlu
doaj +1 more source
Graceful centers of graceful graphs and universal graceful graphs
, 2019 In this paper we define graceful center of a graceful graph. We proved any graph G which admits α-labeling has at least four graceful centers. We also defined a new strong concept of universal graceful graph.
Makadia, H. M. +2 more
core +1 more source
Smart Nanotechnologies for Multimodal Neuromodulation and Brain Interfacing
Advanced Science, EarlyView.Recent advances in smart nanotechnologies are expanding the toolbox for brain interfacing, from wireless neuromodulation and high‐resolution sensing to targeted delivery within the central nervous system. By combining responsive nanomaterials with bioinspired design, these platforms enable multimodal interactions with neurons and glia, while also ...
Tommaso Curiale +6 more
wiley +1 more source
SUPER EDGE MAGIC GRACEFUL TOTAL LABELING OF SOME GRAPHS [PDF]
, 2019 Let a ( , ) p q graph G with the vertex set V G( ) , the edge set E G( ) , the number of vertices is p, and the number of edges is q. The edge magic graceful total labeling of graph G is a bijection from V G E G ( ) ( ) to the integers {1, 2,.
Wahyudi, Zainatul Fatimah Mutiara
core +1 more source
On Graceful Spider Graphs with at Most Four Legs of Lengths Greater than One
Journal of Applied Mathematics, 2016 A graceful labeling of a tree T with n edges is a bijection f:V(T)→{0,1,2,…,n} such that {|f(u)-f(v)|:uv∈E(T)} equal to {1,2,…,n}. A spider graph is a tree with at most one vertex of degree greater than 2. We show that all spider graphs with at most four
A. Panpa, T. Poomsa-ard
doaj +1 more source
Edge even graceful labeling of torus grid graph
, 2020 We study the family of torus grid graphs. We also obtain necessary and sufficent conditions to be edge even graceful labeling for all of the cases of every member of this ...
Saleh, Wedad, Daoud, Salama Nagy
core +1 more source
Advanced Science, EarlyView.An origami worm‐inspired robot achieves multimodal locomotion in confined pipelines through mechatronic integration that embeds actuation, control, and communication within each origami module. Large, reversible configuration and dimensional changes enable 25 gaits synthesized by a unified framework across peristaltic, inchworm, and wheel‐rolling modes
Qiwei Zhang +6 more
wiley +1 more source
Theory and Applications of Graphs, 2020 In his classical paper [14], Rosa introduced a hierarchical series of labelings called ρ, σ, β and α labeling as a tool to settle Ringel’s Conjecture which states that if T is any tree with m edges then the complete graph K2m+1 can be decomposed into 2m +
G. Sethuraman, M. Sujasree
doaj +1 more source
A note on the number of graceful labellings of paths
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robert E. L. Aldred +2 more
openaire +2 more sources