Results 21 to 30 of about 103,423 (250)
Ordered graceful labellings of the 2-star [PDF]
Discrete Mathematics, 2001 The authors investigate ordered graceful labellings of 2-stars. They give a lower bound on the number of non-equivalent ordered graceful labellings by constructing an exponential number of such labellings. This shows that a conjecture of Cahit is false.
Richard J. Nowakowski +1 more
openaire +4 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
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 +2 more sources
A new class of graceful graphs: k-enriched fan graphs and their characterisations
Cubo, 2021 The Graceful Tree Conjecture stated by Rosa in the mid 1960s says that every tree can be gracefully labelled. It is one of the best known open problems in Graph Theory.
M. Haviar, S. Kurtulík
doaj +1 more source
Exploring Relationship Between Traditional Lattices and Graph Lattices of Topological Coding
Jisuanji kexue yu tansuo, 2021 It is known that there are no polynomial quantum algorithms to solve some lattice difficult problems. Uncolored graphic lattice and colored graphic lattice are the products of multidisciplinary intersection inspired by lattice theory. A uncolored graphic
ZHANG Mingjun, YANG Sihua, YAO Bing
doaj +1 more source
A Study of Independency on Fuzzy Resolving Sets of Labelling Graphs
Mathematics, 2023 Considering a fuzzy graph G is simple and can be connected and considered as a subset H=u1,σu1,u2,σu2,…uk,σuk, |H|≥2; then, every two pairs of elements of σ−H have a unique depiction with the relation of H, and H can be termed as a fuzzy resolving set ...
Ramachandramoorthi Shanmugapriya +3 more
doaj +1 more source
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
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