Results 51 to 60 of about 1,212,791 (104)
Fortschritte der Physik, Volume 74, Issue 4, April 2026.Abstract String theory has strong implications for cosmology, implying the absence of a cosmological constant, ruling out single‐field slow‐roll inflation, and that black holes decay. The origins of these statements are elucidated within the string‐theoretical swampland programme.
Kay Lehnert
wiley +1 more source
On super vertex-graceful unicyclic graphs [PDF]
, 2009 summary:A graph $G$ with $p$ vertices and $q$ edges, vertex set $V(G)$ and edge set $E(G)$, is said to be super vertex-graceful (in short SVG), if there exists a function pair $(f, f^+)$ where $f$ is a bijection from $V(G)$ onto $P$, $f^+$ is a bijection
Lee, Sin-Min, Ng, Ho Kuen, Leung, Elo
core +1 more source
A Note on 1-Edge Balance Index Set [PDF]
, 2012 A graph labeling is an assignment of integers to the vertices or edges or both, subject to certain conditions. Varieties of graph labeling have been investigated by many authors [2], [3] [5] and they serve as useful models for broad range of ...
Chandrashekar Adiga, +2 more
core +1 more source
Fortschritte der Physik, Volume 74, Issue 4, April 2026.ABSTRACT In this paper, we continue the development of the Cartan neural networks programme, launched with three previous publications, by focusing on some mathematical foundational aspects that we deem necessary for our next steps forward. The mathematical and conceptual results are diverse and span various mathematical fields, but the inspiring ...
Pietro Fré +4 more
wiley +1 more source
, 2016 [[abstract]]Let G be a undirected graph with a vertex set V and an edge set E. Given a nonnegative integer set D. A D-graceful labeling f of G is an injection f : V → D such that {|f(x) − f(y)| ¯¯ xy ∈ E} = {1, 2, 3, . . . , |E|}.
顏經和 +3 more
core
Further results on super graceful labeling of graphs [PDF]
, 2016 Let G=(V(G),E(G)) be a simple, finite and undirected graph of order p and size q. A bijection f:V(G)∪E(G)→{k,k+1,k+2,…,k+p+q−1} such that f(uv)=|f(u)−f(v)| for every edge uv∈E(G) is said to be a k-super graceful labeling of G.
Ng, Ho-Kuen +5 more
core +1 more source
Critical Quarterly, Volume 68, Issue 2, Page 23-38, July 2026.
Jerome Boyd Maunsell
wiley +1 more source
Pelabelan Graceful Sisi-ganjil Pada Graf Web W(2,n) [PDF]
, 2014 Let G = (V(G),E()) be a graph with vertex set () and edge set (). Assume that graph G have edge. Graceful edge-odd labeling is a bijective map ∶ () → {1, 3, 5,…,2 – 1} that resulting map + : () → {0,1,2,…,2 −1} with
Ratnasari, L. (Lucia) +2 more
core
, 2011 A graph that has a Smarandachely vertex-mean k-labeling is called Smarandachely k vertex-mean graph or Smarandachely k V -mean graph. Particularly, if k = 0, such a Smarandachely vertex-mean 0-labeling and Smarandachely 0 vertex-mean graph or ...
Lourdusamy, A., Seenivasan, M.
core +1 more source
On the Odd Gracefulness of Cyclic Snakes With Pendant Edges
, 2021 Graceful and odd gracefulness of a graph are two entirely different concepts. A graph may posses one or both of these or neither. We present four new families of odd graceful graphs.
E. M. Badr
core +1 more source