Results 61 to 70 of about 848 (243)

Alpha graphs with different pendent paths

Electronic Journal of Graph Theory and Applications, 2020
Graceful labelings are an effective tool to find cyclic decompositions of complete graphs and complete bipartite graphs. The strongest kind of graceful labeling, the α-labeling, is in the center of the research field of graph labelings, the existence of ...
Christian Barrientos
doaj   +1 more source

From Artificial to Embodied and Physical Intelligence in Smart Manufacturing

Advanced Science, EarlyView.
Smart manufacturing is reframed through complementary artificial, embodied, and physical intelligence, spanning computational reasoning, perception‐action coupling, and material‐level adaptation. Their integration across design, fabrication, operation, and maintenance reveals how intelligence can be co‐designed across algorithms, embodied agents, and ...
Kang Wang, Xinyu Lu, Tong Liu, Jinjie Fang, Xin Li, Siqian Wu, Liuchao Jin, Wei‐Hsin Liao, Shuyou Zhang, Jianrong Tan   +9 more
wiley   +1 more source

On the Role of Preprocessing and Memristor Dynamics in Reservoir Computing for Image Classification

Advanced Electronic Materials, EarlyView.
ABSTRACT Reservoir computing (RC) is an emerging recurrent neural network architecture that has attracted growing attention for its low training cost and modest hardware requirements. Memristor‐based circuits are particularly promising for RC, as their intrinsic dynamics can reduce network size and parameter overhead in tasks such as time‐series ...
Rishona Daniels, Duna Wattad, Ronny Ronen, David Saad, Shahar Kvatinsky   +4 more
wiley   +1 more source

A PROCEDURE FOR DERIVING ODD-GRACEFUL CHROMATIC NUMBERS OF GRAPHS

Ural Mathematical Journal
Let \(G:=(V,E)\) be an undirected finite simple graph with vertex set \(V\) and edge set \(E\). A function \(c:V(G)\rightarrow \{1,2,\ldots,k\},\) for some positive integer \(k\), such that \(c(u)\neq c(v)\) for every edge \(uv\in E(G)\), is called a ...
I Nengah Suparta, I Gede Adhitya Wisnu Wardhana, I Gede Aris Gunadi, I Dewa Made Agus Ariawan   +3 more
doaj   +1 more source

On the Graceful Cartesian Product of Alpha-Trees

Theory and Applications of Graphs, 2017
A \emph{graceful labeling} of a graph $G$ of size $n$ is an injective assignment of integers from the set $\{0,1,\dots,n\}$ to the vertices of $G$ such that when each edge has assigned a \emph{weight}, given by the absolute value of the difference of the
Christian Barrientos, Sarah Minion
doaj   +1 more source

Graceful and Odd Graceful Labeling of Graphs

International Journal of Mathematics and Soft Computing, 2016
In this paper we prove gracefulness and odd gracefulness of arbitrary super -subdivision of triangular snake, where labeling of the vertices follows arithmetic progression.
openaire   +1 more source

Engineered 3D Fibronectin‐Based Environments Modulate the Pathogenic Profile of Arthritic Synovial Fibroblasts

Advanced NanoBiomed Research, EarlyView.
Fibroblast behavior is shaped by the surrounding microenvironment, yet conventional culture systems often fail to capture disease‐relevant phenotypes. Here, platform‐dependent responses of healthy and arthritic synovial fibroblasts are examined across 2D and 3D culture systems. Distinct inflammatory and proliferative signatures emerge, highlighting how
Aneesah Khan, Piaopiao Pan, Yanling Lan, Çağlar Çi̇l, Julia Isakova, Yilin Wang, Theodora Rogkoti, Thanutchaporn Sartyoungkul, James F. C. Windmill, Jonathan William, Manuel Salmeron‐Sanchez, Margaret H. Harnett, Oana Dobre, Miguel A. Pineda   +13 more
wiley   +1 more source

Node-graceful graphs

Computers & Mathematics with Applications, 1988
The authors generalize the well-known concept of a graceful graph by introducing the notion of a node-graceful graph. Furthermore, they give some examples of node-graceful graphs which are very interesting because they show the connection between graph theory and its applications to an expanding range of domains.
Harary, Frank, Hsu, D.Frank
openaire   +1 more source

Single‐subject designs in character education: Methods for rigorous, contextual, and practitioner‐led research

British Educational Research Journal, EarlyView.
Abstract Character education research is often constrained by blunt methodological tools. Surveys capture breadth without depth; case studies offer richness but lack replicability; and randomised controlled trials (RCTs), though indispensable at the policy level, are costly, disruptive and ill‐suited to everyday practice with individual pupils.
Shane McLoughlin
wiley   +1 more source

Some Graceful Graphs

International Journal of Mathematics and Soft Computing, 2014
In this paper, we have investigate some general classes of connected graceful graphs. We prove that cycles $C_{n}, C_{m}$ joined by an arbitrary path $P_{k}$, where $m,n \equiv 0$ (mod $4$), a cycle $C_{n}$, ($n \equiv 2$ (mod $4$)) with twin chords and a path union of cycles $C_{n}$, ($n \equiv 0$ (mod $4$)) are graceful graphs.
Meera Meghapara, H. M. Makadia, V. J. Kaneria   +2 more
openaire   +1 more source