Results 11 to 20 of about 107,087 (251)
m -Bonacci graceful labeling [PDF]
AKCE International Journal of Graphs and Combinatorics, 2021 We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci graceful if the vertices can be labeled with distinct integers from the set such that the derived edge labels are the first n m-bonacci numbers. We show that complete graphs, complete bipartite graphs, gear graphs, triangular grid graphs, and wheel graphs ...
Kalpana Mahalingam +1 more
openaire +3 more sources
Relaxed Graceful Labellings of Trees [PDF]
The Electronic Journal of Combinatorics, 2002 A graph $G$ on $m$ edges is considered graceful if there is a labelling $f$ of the vertices of $G$ with distinct integers in the set $\{0,1,\dots,m\}$ such that the induced edge labelling $g$ defined by $g(uv)=|f(u)-f(v)|$ is a bijection to $\{1,\dots,m\}$. We here consider some relaxations of these conditions as applied to tree labellings: 1.
Frank Van Bussel
openaire +4 more sources
Computer search for graceful labeling: a survey [PDF]
Electronic Journal of Graph Theory and Applications, 2022 Summary: This paper surveys the main computer search results for finding graceful labeling of trees. The paper is devoted to the memory of Mirka Miller, who made an outstanding contribution to the area of graph labeling.
Ljiljana Brankovic, Michael J. Reynolds
openaire +4 more sources
Real-graceful labellings: a generalisation of graceful labellings.
Ars Comb., 2011 Every graph can be associated to a characteristic exponential equation involving powers of (say) 2, whose unknowns represent vertex labels and whose general solution is equivalent to a graceful labelling of the graph. If we do not require that the solutions be integers, we obtain a generalisation of a graceful labelling that uses real numbers as labels.
VIETRI, Andrea
openaire +3 more sources
Evaluating the involvement of autolysosomes in the nuclear translocation of fluorescent proteins. [PDF]
FEBS Open BioEndogenously expressed fluorescent proteins can be degraded by autophagy and transported to cell nuclei via the nuclear pore complex. But in some cell lines, for example, HeLa cells which are positive for immunoreactivity of a receptor ligand, such as UCN I, in cell nuclei, fusion of autolysosome with the nuclear envelope is involved in the nuclear ...
Ikeda K.
europepmc +2 more sources
Graceful labeling of digraphs—a survey [PDF]
AKCE International Journal of Graphs and Combinatorics, 2021 A digraph D with p vertices and q arcs is labeled by assigning a distinct integer value g(v) from to each vertex v. The vertex values, in turn, induce a value g(u, v) on each arc (u, v) where g(u, v) = (g(v) − g(u)) (mod q + 1) If the arc values are all distinct then the labeling is called a graceful labeling of digraph. In this survey article, we have
Shivarajkumar +2 more
openaire +3 more sources
Graceful labellings of new families of windmill and snake graphs [PDF]
, 2021 A function ƒ is a graceful labelling of a graph G = (V,E) with m edges if ƒ is an injection ƒ : V (G) → {0, 1, 2, . . . ,m} such that each edge uv ∈ E is assigned the label |ƒ(u) − ƒ(v)| ∈ {1, 2, . . . ,m}, and no two edge labels are the same.
Alkasasbeh, Ahmad
core +1 more source
Graceful Labeling of Hypertrees
Journal of Mathematics Research, 2021 Graph labeling is considered as one of the most interesting areas in graph theory. A labeling for a simple graph G (numbering or valuation), is an association of non -negative integers to vertices of G (vertex labeling) or to edges of G (edge labeling) or both of them.
H. El-Zohny +3 more
openaire +2 more sources
Super Fibonacci Graceful Labeling of Some Special Class of Graphs [PDF]
, 2011 A Fibonacci graceful labeling and a super Fibonacci graceful labeling on graphs were introduced by Kathiresan and Amutha in ...
Sridevi, R. +2 more
core +1 more source
Vertex Graceful Labeling-Some Path Related Graphs [PDF]
, 2013 Treating subjects as vertex graceful graphs, vertex graceful labeling, caterpillar, actinia graphs, Smarandachely vertex m ...
Balaganesan, P. +2 more
core +1 more source