Results 71 to 80 of about 1,379,256 (326)
Radio Heronian Mean k-Graceful Labeling on Degree Splitting of Graphs
Ratio Mathematica, 2023 A mapping g:V\left(G\right)\rightarrow{k,k+1,\ldots,k+N-1} is a radio heronian mean k-labeling such that if for any two distinct vertices s and t of G, d\left(s,t\right)+\left\lceil\frac{g\left(s\right)+g\left(t\right)+\sqrt{g\left(s\right)g\left(t\right)
K Sunitha, K Vimal Rani
doaj +1 more source
A note on the number of graceful labellings of paths
Discrete Mathematics, 2003 AbstractWith the help of a simple recursive construction we give a computer-assisted proof that the number of graceful labellings of a path of length n grows asymptotically at least as fast as (5/3)n. Results of this type have found surprising applications in topological graph theory.
R. E. L. Aldred +2 more
openalex +3 more sources
ARITHMETIC SEQUENTIAL GRACEFUL LABELING ON STEP GRID GRAPH
INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER RESEARCHLet G be a simple, finite, connected, undirected, non-trivial graph with vertices and edges. be the vertex set and be the edge set of Let where a and is an injective function.
P. S. P. Sumathi, G. G. Ramani
semanticscholar +1 more source
Lucas Gracefulness of Almost and Nearly for Some Graphs [PDF]
, 2011 By a graph, we mean a finite undirected graph without loops or multiple ...
Nagarajan, A. +2 more
core +1 more source
Advanced Biology, EarlyView.The prodrug strategy used in this study offers new promise for cancer metabolism‐based therapies. JHU083, a prodrug that, when cleaved by protease in the tumor microenvironment, yields the glutamine antagonist DON. JHU083 inhibits tumor growth by targeting glutamine‐addicted cancer cells and suppressing glutamine‐dependent M2 macrophages, leading to a ...
Tianhe Li +10 more
wiley +1 more source
Special Graceful Labelings of Irregular Fences and Lobsters
Universal Journal of Mathematics and Applications, 2019 Irregular fences are subgraphs of $P_m \times P_n$ formed with $m$ copies of $P_n$ in such a way that two consecutive copies of $P_n$ are connected with one or two edges; if two edges are used, then they are located in levels separated an odd number of ...
Christian Barrientos
doaj +1 more source
Electronic Journal of Graph Theory and Applications, 2020 Two methods for expanding graceful trees are introduced. In constructing a larger graceful trees, these methods are based on a collection of certain graceful trees and one graceful tree as the core of the produced graceful tree.
I Nengah Suparta, I Dewa M. Agus Ariawan
doaj +1 more source
Odd Harmonious Labeling of Some Graphs [PDF]
, 2012 The labeling of discrete structures is a potential area of research due to its wide range of applications.
Shah, N.H., Vaidya, S.K.
core +1 more source
EVEN GRACEFUL LABELLING OF A CLASS OF TREES
, 2019 A labelling or numbering of a graph G with q edges is an assignment of labels to the vertices of G that induces for each edge uv a labelling depending on the vertex labels f(u) and f(v). A labelling is called a graceful labelling if there exists an injective function f: V (G) → {0, 1,2,......q} such that for each edge xy, the labelling │f(x)-f(y)│is ...
T.K, Mathew Varkey, T.J, Rajesh Kumar
openaire +5 more sources
Advanced Functional Materials, EarlyView.This work investigates modifying interfacial contacts in realizing giant‐performance semiconductor nanomembrane optoelectronics. Strategies, including surface reaction and buffer layer work‐function modulation, are explored to boost the Schottky barrier. An emerging material of YbOx is utilized for near‐ideal Ohmic contact.
Yibo Zhang +5 more
wiley +1 more source