Results 51 to 60 of about 209,693 (137)
Graceful And Graceful Labeling Of Graphs
, 2018 {"references": ["1.\tJ. A. Gallian, A Dynamic survey of graph labeling, The electronic journal of combinatory 16 (2009).DS6. 2.\tI. Gutman, The energy of a graph, Ber. Math-satist. sekt. Forschungsz. Graz 103 (1978), 1-22. 3.\tGutman and B. Zhou, Laplacian energy of a graph, linear algebra appl. 414 (2006), 29-37. 4.\tI.
M. Soundharya, R. Balakumar
openaire +2 more sources
Improper Graceful and Odd-graceful Labellings of Graph Theory
CoRR, 2015 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 the new labellings to construct large scale of graphs having improper graceful/odd-graceful labellings or having ...
Hongyu Wang 0006, Jin Xu 0002, Bing Yao
openaire +2 more sources
Radio Heronian Mean k-Graceful Labeling on Degree Splitting of Graphs
Ratio Mathematica, 2023 A mapping g:V\left(G\right)\rightarrow{k,k+1,\ldots,k+N-1} is a radio heronian mean k-labeling such that if for any two distinct vertices s and t of G, d\left(s,t\right)+\left\lceil\frac{g\left(s\right)+g\left(t\right)+\sqrt{g\left(s\right)g\left(t\right)
K Sunitha, K Vimal Rani
doaj +1 more source
Lucas Gracefulness of Almost and Nearly for Some Graphs [PDF]
, 2011 By a graph, we mean a finite undirected graph without loops or multiple ...
Perumal, M.A. +2 more
core +1 more source
, 2023 In this paper, we show that arbitrary super subdivisions of ladder graphs and super subdivisions of ladder graphs are M modulo N graceful Labeling.
Velmurugan, C., V, Ramachandran
core +1 more source
Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Electronic Journal of Graph Theory and Applications, 2020 Two methods for expanding graceful trees are introduced. In constructing a larger graceful trees, these methods are based on a collection of certain graceful trees and one graceful tree as the core of the produced graceful tree.
I Nengah Suparta, I Dewa M. Agus Ariawan
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2016 For k ∈ ℤ+ and G a simple, connected graph, a k-radio labeling f : V (G) → ℤ+ of G requires all pairs of distinct vertices u and v to satisfy |f(u) − f(v)| ≥ k + 1 − d(u, v). We consider k-radio labelings of G when k = diam(G).
Niedzialomski Amanda
doaj +1 more source
Special Graceful Labelings of Irregular Fences and Lobsters
Universal Journal of Mathematics and Applications, 2019 Irregular fences are subgraphs of $P_m \times P_n$ formed with $m$ copies of $P_n$ in such a way that two consecutive copies of $P_n$ are connected with one or two edges; if two edges are used, then they are located in levels separated an odd number of ...
Christian Barrientos
doaj +1 more source