Results 71 to 80 of about 828 (253)
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
Parametric design method of building structured cabling system oriented to data mining
IET Networks, EarlyView., 2022 This paper puts forward the method of secondary development and design software through the research of building structured cabling system (SCS), and uses data mining technology to carry out parametric design of building SCS. Then, the feasibility of the design is tested by comparing the data of the traditional design and the parametric design ...
Bing Wang, Wei Yue
wiley +1 more source
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
BMEMat, EarlyView.A nanomotor featuring an “electronic lock” via electron compensation in an Au‐Ag alloy ensures therapeutic precision. Near‐infrared light acts as a key, unlocking on‐demand Ag+ release for synergistic bactericidal action and microenvironment remodeling to potently treat bacterial pneumonia. Abstract Bacterial pneumonia treatment is severely hampered by
Chenglong Xue +4 more
wiley +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
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 +2 more
openaire +1 more source
RNA‐centric world of retroviruses: unravelling the molecular strategies of genomic RNA packaging
Biological Reviews, EarlyView.ABSTRACT Retroviruses constitute a unique group of RNA viruses that have profoundly influenced both evolutionary trajectories and biomedical research. Their ability to reverse transcribe and integrate into host genomes has shaped genomic architecture across species and contributed to our understanding of oncogenes, gene regulation, and RNA biology ...
Mohammad Abdullah Jehad +5 more
wiley +1 more source
Facial graceful coloring of plane graphs [PDF]
Opuscula MathematicaLet \(G\) be a plane graph. Two edges of \(G\) are facially adjacent if they are consecutive on the boundary walk of a face of \(G\). A facial edge coloring of \(G\) is an edge coloring such that any two facially adjacent edges receive different colors ...
Július Czap
doaj +1 more source
Business Strategy and the Environment, EarlyView.ABSTRACT Social media platforms today have become essential for consumer‐brand interactions, with visual content playing a pivotal role in shaping engagement and brand perception. Although text‐based user‐generated content (UGC) has been widely studied, the potential of visual UGC, particularly in the travel, tourism and hospitality (TTH) sector ...
Chinchu Abraham +2 more
wiley +1 more source
Journal of Mathematics Research, 2012 We have investigated some general classes of disconnected graceful graphs. We obtain the graceful labeling for $(P_{m} \times P_{n})~\bigcup~(P_{r} \times P_{s})$,~$C_{2f+3}~\bigcup~(P_{m} \times P_{n})~\bigcup~(P_{r} \times P_{s})$, where $ m,~n,~ r, ~s \in N - \{1\} $ and $f= 2(mn + rs) - (m + n + r + s)$.
V. J. Kaneria, H. M. Makadia
openaire +2 more sources