Results 41 to 50 of about 1,000,377 (259)
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
HoloCast: Graph Signal Processing for Graceful Point Cloud Delivery [PDF]
ICC 2019 - 2019 IEEE International Conference on Communications (ICC), 2019 In conventional point cloud delivery, a sender uses octree-based digital video compression to stream three-dimensional (3D) points and the corresponding color attributes over band-limited links, e.g., wireless channels, for 3D scene reconstructions ...
T. Fujihashi +3 more
semanticscholar +1 more source
Further results on super graceful labeling of graphs
AKCE International Journal of Graphs and Combinatorics, 2016 Let G=(V(G),E(G)) be a simple, finite and undirected graph of order p and size q. A bijection f:V(G)∪E(G)→{k,k+1,k+2,…,k+p+q−1} such that f(uv)=|f(u)−f(v)| for every edge uv∈E(G) is said to be a k-super graceful labeling of G.
Gee-Choon Lau, Wai Chee Shiu, Ho-Kuen Ng
doaj +1 more source
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.
Kalpana Mahalingam +1 more
doaj +1 more source
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
Graceful Labeling For bipartite graceful Graphs and related Graphs
, 2020 The concept of graceful labels was proposed by Rosa, scholars began to study graceful labels of various graphs and obtained relevant results.Let the graph is a bipartite graceful graph, we have proved some graphs are graceful labeling in this paper.
Liu, Chunfeng +2 more
openaire +2 more sources
Odd graceful labeling for the jewel graph and the extended jewel graph without the prime edge*
Bulletin of Pure & Applied Sciences- Mathematics and Statistics, 2020 R.B.
J. Jesintha +4 more
semanticscholar +1 more source
The subdivision graph of a graceful tree is a graceful tree
Discrete Mathematics, 1998 A graph \(G= (V,E)\) is graceful, if there is a numbering \(f\) of the vertices from \(1\) to \(| V|\), such that all values \(| f(v)- f(w)|\) are distinct for all edges \(\{v,w\}\in E\). The subdivision graph of a graph is obtained by adding a vertex on the middle of each edge. It is shown that the subdivision graph of a graceful tree is also graceful.
M. Burzio, G. Ferrarese
openaire +2 more sources
ODD GRACEFUL LABELING OF SPADE GRAPH AND ITS DERIVED GRAPHS
International Journal of Applied MathematicsIn this paper, we investigate odd graceful labeling of spade graph and its associated graph operations. We prove that the spade graph is odd graceful and further show that graphs obtained by joining copies of spade graph, path union of spade graph, and ...
K. N. Gotecha
semanticscholar +1 more source
GRACEFUL CHROMATIC NUMBER OF SOME CARTESIAN PRODUCT GRAPHS
Ural Mathematical Journal, 2023 A graph \(G(V,E)\) is a system consisting of a finite non empty set of vertices \(V(G)\) and a set of edges \(E(G)\). A (proper) vertex colouring of \(G\) is a function \(f:V(G)\rightarrow \{1,2,\ldots,k\},\) for some positive integer \(k\) such that ...
I Nengah Suparta +3 more
doaj +1 more source