Results 1 to 10 of about 103,423 (250)
Lucas Graceful Labeling For Some Graphs [PDF]
, 2011 By a graph, we mean a finite undirected graph without loops or multiple edges.
Perumal, M. A. +2 more
openaire +4 more sources
ON k-GRACEFUL LABELING OF SOME GRAPHS
Journal of applied mathematics & informatics, 2016 Summary: In this paper, it has been shown that the hairy cycle \(C_{n}\odot rK_{1},\) \(n\equiv 3\pmod 4\), the graph obtained by adding pendant edge to each pendant vertex of hairy cycle \(C_{n}\odot 1K_{1}\), \(n\equiv 0\pmod 4\), double graph of path \(P_{n}\) and double graph of comb \(P_{n}\odot 1K_{1}\) are \(k\)-graceful.
Pradhan, P., Kumar, Kamesh
openaire +3 more sources
Graceful Labeling of Balanced Stars of Paths
Electronic Notes in Discrete Mathematics, 2003 Abstract If the vertices of a tree on n vertices are labeled by the distinct numbers l,2,…, n , in such a way that the set of edge-differences (i.e., the differences between the labels on adjacent pairs of vertices) is exactly {1, 2,…, n − 1}, then such a labeling is called a graceful labeling. The graceful tree conjecture of Ringel and Kotzig
R. Badrinath, Pratima Panigrahi
openaire +1 more source
Graphic Groups, Graph Homomorphisms, and Graphic Group Lattices in Asymmetric Topology Cryptography. [PDF]
Entropy (Basel), 2023 Zhao M, Wang H, Yao B.
europepmc +1 more source
On graceful labelings of trees
, 2018 We prove via a composition lemma, the Kotzig-Ringel-Rosa conjecture, better known as the Graceful Labeling Conjecture. We also prove via a stronger version of the composition lemma a stronger form of the Graceful Labeling Conjecture.
openaire +2 more sources
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
Obtention of solar cell parameters, through convergence of iterative cycles. Part 2: Application to experimental current-voltage measurements. [PDF]
Heliyon, 2022 Rangel-Kuoppa VT.
europepmc +1 more source
On $k$-Super Graceful Labeling of Graphs
, 2018 Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $p$ and size $q$. For $k\ge 1$, a bijection $f: V(G)\cup E(G) \to \{k, k+1, k+2, \ldots, k+p+q-1\}$ such that $f(uv)= |f(u) - f(v)|$ for every edge $uv\in E(G)$ is said to be a $k$-super graceful labeling of $G$.
Lau, Gee-Choon +2 more
openaire +3 more sources
Wheat Ear Segmentation Based on a Multisensor System and Superpixel Classification. [PDF]
Plant Phenomics, 2022 Carlier A +3 more
europepmc +1 more source
Representational ethical model calibration. [PDF]
NPJ Digit Med, 2022 Carruthers R +8 more
europepmc +1 more source