Results 81 to 90 of about 1,632,039 (225)
\(V_k\)-Super vertex magic graceful labeling of graphs
Sivagnanam Mutharasu +2 more
openalex +2 more sources
Sulfavant A as the first synthetic TREM2 ligand discloses a homeostatic response of dendritic cells after receptor engagement. [PDF]
Gallo C +12 more
europepmc +1 more source
Graceful Labeling of Chain Graphs with Pendants
W. K. M. Indunil, A. A. I. Perera
openalex +1 more source
Graceful labellings of variable windmills using Skolem sequences [PDF]
Ahmad H. Alkasasbeh +2 more
openalex +1 more source
On $k$-Super Graceful Labeling of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $p$ and size $q$. For $k\ge 1$, a bijection $f: V(G)\cup E(G) \to \{k, k+1, k+2, \ldots, k+p+q-1\}$ such that $f(uv)= |f(u) - f(v)|$ for every edge $uv\in E(G)$ is said to be a $k$-super graceful labeling of $G$.
Lau, Gee-Choon +2 more
openaire +3 more sources
The Graceful Tree Conjecture was published almost 40 years ago and nowadays it is still an open problem. It seems as difficult to solve as it is to enunciate: every tree admits a vertex labeling on 0, 1, ..., n-1 such that the set of values of the differences of the numbers assigned to the ends of each edge is the set {1, 2, ..., n-1}.
openaire +1 more source
Origin, Selection and Current Status of the Utrerana Chicken Breed: A Review. [PDF]
Plata-Casado A +2 more
europepmc +1 more source
On graceful labelings of trees
We prove via a composition lemma, the Kotzig-Ringel-Rosa conjecture, better known as the Graceful Labeling Conjecture. We also prove via a stronger version of the composition lemma a stronger form of the Graceful Labeling Conjecture.
openaire +2 more sources
The computer, A choreographer? Aesthetic responses to randomly-generated dance choreography by a computer. [PDF]
Darda KM, Cross ES.
europepmc +1 more source
EVEN RADIO MEAN GRACEFUL LABELING ON DEGREE SPLITTING OF SNAKE RELATED GRAPHS
Brindha Mary V. T. +2 more
openalex +1 more source

