Results 41 to 50 of about 209,693 (137)
Radio Number of Hamming Graphs of Diameter 3
Theory and Applications of Graphs, 2022 For $G$ a simple, connected graph, a vertex labeling $f:V(G)\to \Z_+$ is called a \emph{radio labeling of $G$} if it satisfies $|f(u)-f(v)|\geq\diam(G)+1-d(u,v)$ for all distinct vertices $u,v\in V(G)$.
Jason DeVito +2 more
doaj +1 more source
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.
openaire +3 more sources
A survey and a new class of graceful unicylic graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A graph G admits a graceful labeling if there is a one-to-one map f from the set of vertices of G to such that when an edge xy is assigned the label the resulting set of edge labels is When such a labeling exists, G is called graceful. Rosa showed that a
Max Pambe Biatch’ +2 more
doaj +1 more source
Graceful labeling construction for some special tree graph using adjacency matrix
Electronic Journal of Graph Theory and Applications, 2023 In 1967, Rosa introduced β − labeling which was then popularized by Golomb under the name graceful. Graceful labeling on a graph G is an injective function f : V(G)→{0, 1, 2, …, |E(G)|} such that, when each edge uv ∈ E(G) is assigned the label |f(u)−f(v)|
Nikson Simarmata +2 more
doaj +1 more source
On Cubic Graceful Labeling [PDF]
, 2017 A graph with n vertex and m edges is said to be cubic graceful labeling if its vertices are labeled with distinct integers {0,1,2,3,……..,m3} such that for each edge f*( uv) induces edge mappings are {13,23,33,……,m3}.
, Mathew Varkey T. K, Mini. S. Thomas
core +1 more source
, 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
Generating graceful unicyclic graphs from a given forest
AKCE International Journal of Graphs and Combinatorics, 2020 Acharya (1982) proved that every connected graph can be embedded in a graceful graph. The generalization of this result that, any set of graphs can be packed into a graceful graph was proved by Sethuraman and Elumalai (2005). Recently, Sethuraman et al. (
G. Sethuraman, V. Murugan
doaj +1 more source
Additively graceful signed graphs
AKCE International Journal of Graphs and Combinatorics, 2023 Let [Formula: see text] be a signed graph of order p and size q. Let [Formula: see text] and [Formula: see text] Let [Formula: see text] be an injective function and let [Graphic: see text]gf(uv)={|f(u)−f(v)| if uv∈E+f(u)+f(v) if uv∈E−The function f is ...
Jessica Pereira +2 more
doaj +1 more source
Construction of an -labeled tree from a given set of -labeled trees
AKCE International Journal of Graphs and Combinatorics, 2017 Inspired by the method of Koh et al. (1979) of combining known graceful trees to construct bigger graceful trees, a new class of graceful trees is constructed from a set of known graceful trees, in a specific way.
G. Sethuraman, P. Ragukumar
doaj +1 more source
Absolutely Harmonious Labeling of Graphs [PDF]
, 2011 In this paper, we obtain necessary conditions for a graph to be absolutely harmonious and study absolutely harmonious behavior of certain classes of ...
Lourdusamy, A., Seenivasan, M.
core +1 more source