Related papers: On super edge-graceful trees of diameter four
We introduce left and right-layered trees as trees with a specific representation and define the excess of a tree. Applying these ideas, we show a range-relaxed graceful labeling which improves on the upper bound for maximum vertex label…
A graph G=(V,E) with m edges is graceful if it has a distinct vertex labeling f, a map from V into the set{0,1,2,3,...,m} which induces a distinct edge labeling |f(u)-f(v)| for edges uv in E. The famous Ringel-Kotzig conjecture (1964) is…
A graceful labelling of a graph G is an injective function f from the set of vertices of G into the set {0,1,...,|EG|} such that if edge uv is assigned the label |f(u)-f(v)| then all edge labels have distinct values. A strong graceful…
A difference vertex labeling of a graph G is an assignment f of labels to the vertices of G that induces for each edge xy the weight |f(x)-f(y)|. A difference vertex labeling f of a graph G of size n is odd-graceful if f is an injection…
In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can induce graceful graphs having at least a cycle. We, next, apply…
Let $T$ be an $n$-node tree of maximum degree 4, and let $P$ be a set of $n$ points in the plane with no two points on the same horizontal or vertical line. It is an open question whether $T$ always has a planar drawing on $P$ such that…
A graph $G$ on $m$ edges is graceful if there is an injection $f : V(G) \to \{0, 1, \ldots, m\}$ whose induced edge labels $\{|f(u) - f(v)| : uv \in E(G)\}$ are exactly $\{1, 2, \ldots, m\}$. Ringel and Kotzig conjectured in 1964 that every…
Given a graph $G$, a labeling of $G$ is an injective function $f:V(G)\rightarrow\mathbb{Z}_{\ge 0}$. Under the labeling $f$, the label of a vertex $v$ is $f(v)$, and the induced label of an edge $uv$ is $|f(u) - f(v)|$. The labeling $f$ is…
Graceful tree conjecture is a well-known open problem in graph theory. Here we present a computational approach to this conjecture. An algorithm for finding graceful labelling for trees is proposed. With this algorithm, we show that every…
We consider graph labelings with an assignment of odd prime numbers to the vertices. Similarly to graceful graphs, a labeling is said to be elegant if the absolute differences between the labels of adjacent vertices describe exactly the…
We answer two questions of Shamik Ghosh in the negative. We show that there exists a lobster tree of diameter less than 6 which accepts no alpha-labeling with two central vertices labeled by the critical number and the maximum vertex label.…
The super edge-magicness of graphs of equal order and size has been shown to be important since such graphs can be used as seeds to answer many questions related to (super) edge-magic labelings and other types of well studied labelings, as…
An $n$-vertex tree $T$ is said to be $\textit{graceful}$ if there exists a bijective labelling $\phi:V(T)\to \{1,\ldots,n\}$ such that the edge-differences $\{|\phi(x)-\phi(y)| : xy\in E(T)\}$ are pairwise distinct. The longstanding…
Loebl, Komlos, and Sos conjectured that if at least half the vertices of a graph G have degree at least some k, then every tree with at most k edges is a subgraph of G. We prove the conjecture for all trees of diameter at most 5 and for a…
Let $G=(V,E)$ be an $n$-vertex graph with $m$ edges. A function $f : V \cup E \rightarrow \{1, \ldots, n+m\}$ is an edge-magic labeling of $G$ if $f$ is bijective and, for some integer $k$, we have $f(u)+f(v)+f(uv) = k$ for every edge $uv…
This paper presents a characterization of edge-transitive graphs which are four regular and have girth four. This class consists of four infinite families plus four exceptional graphs.
A \emph{graceful labeling} of a graph $G$ is an injective function $f : V(G) \to \{0, \ldots, |E(G)|\}$ such that $\{\,|f(u)-f(v)| : uv \in E(G)\,\} = \{1, \ldots, |E(G)|\}$. If such a labeling exists, then we call $G$ \emph{graceful}.…
A graph $G(V,E)$ of order $|V|=p$ and size $|E|=q$ is called super edge-graceful if there is a bijection $f$ from $E$ to $\{0,\pm 1,\pm 2,...,\pm \frac{q-1}{2}\}$ when $q$ is odd and from $E$ to $\{\pm 1,\pm 2,...,\pm \frac{q}{2}\}$ when…
In this paper, we investigate a problem concerning quartets, which are a particular type of tree on four leaves. Loosely speaking, a set of quartets is said to be `definitive' if it completely encapsulates the structure of some larger tree,…
We obtain an improved lower bound for the regularity of the binomial edge ideals of trees. We prove an upper bound for the regularity of the binomial edge ideals of certain subclass of block-graphs. As a consequence we obtain sharp upper…