Results 61 to 70 of about 209,693 (137)
International Journal of Engineering & Technology, 2018 A graph G with m vertices and n edges, is said to be prime graceful labeling, if there is an injection from the vertices of G to {1, 2, ..., k} where k = min {2m, 2n} such that gcd ( ( ), ( )=1 and the induced injective function from the edges of G to {1, 2, ..., k − 1} defined by ( ) = | ( ) − ( ) | , the resulting edge labels are distinct. In
T. Hameed Hassan, R. Mohammad Abbas
openaire +2 more sources
Annals of Mathematics and PhysicsAbstract The concept of graph labeling was introduced in the mid-1960s by Rosa. In this paper, we introduce a notion of graceful labeling of a finite poset. We obtain graceful labeling of some postes such as a chain, a fence, and a crown. In 2002 Thakare, Pawar, and Waphare introduced the `adjunct' operation of two lattices with respect to an adjunct ...
Ashok Bhavale, Dr. DEEPAK SHELKE*
openaire +2 more sources
GRACEFUL LABEING AND RHO TOPI LABELING ON THE 8-BINTANG GRAPH WITH C3 FOR N ODD [PDF]
, 2019 This paper we propose graceful labeling and labeling on a graph then referred to as 8-Bintang graph, the basic idea of formulation graceful labeling and labeling on an alfabet bintang graphs wih the question a stars graph .
Amri, Zulfi; Universitas Muhammadiyah Sumatera Utara +2 more
core +2 more sources
RADIO GEOMETRIC MEAN GRACEFUL LABELING ON DEGREE SPLITTING OF SOME SPECIAL GRAPHS
, 2023 A radio geometric mean graceful labeling of a connected graph G is a bijection µ from a vertex set V(G) to {1, 2, 3, …, |V(G)|} such that for any two distinct vertices u and v of G, .
T. MARY SHALINI, C. DAVID RA, K. RUBIN MARY
core +1 more source
Journal of Mathematics, 2023 In this article, we adapt the edge-graceful graph labeling definition into block designs and define a block design V,B with V=v and B=b as block-graceful if there exists a bijection f:B⟶1,2,…,b such that the induced mapping f+:V⟶Zv given by f+x=∑x∈AA ...
Dilara Erdemir, Emre Kolotoğlu
doaj +1 more source
On Graceful Spider Graphs with at Most Four Legs of Lengths Greater than One
Journal of Applied Mathematics, 2016 A graceful labeling of a tree T with n edges is a bijection f:V(T)→{0,1,2,…,n} such that {|f(u)-f(v)|:uv∈E(T)} equal to {1,2,…,n}. A spider graph is a tree with at most one vertex of degree greater than 2. We show that all spider graphs with at most four
A. Panpa, T. Poomsa-ard
doaj +1 more source
Graceful and Odd Graceful Labeling of Graphs
International Journal of Mathematics and Soft Computing, 2016 In this paper we prove gracefulness and odd gracefulness of arbitrary super -subdivision of triangular snake, where labeling of the vertices follows arithmetic progression.
openaire +1 more source
Graceful and Odd Graceful Labeling of Some Graphs
International Journal of Mathematics and Soft Computing, 2013 In this paper, we prove that the square graph of bistar Bn,n, the splitting graph of Bn,n and the splitting graph of star K1,n are graceful graphs. We also prove that the splitting graph and the shadow graph of bistar Bn,n admit odd graceful labeling.
N. H. Shah, S. K. Vaidya
openaire +1 more source
GRACEFUL LABELING OF HANGING THETA GRAPHS [PDF]
International Journal of Pure and Apllied Mathematics, 2013 Summary: In this paper, we introduce a new class of hanging theta graphs and prove that those graphs admit graceful labeling.
Janakiraman, T. N., Sathiamoorthy, G.
openaire +1 more source
On $k$-Super Graceful Labeling of Graphs [PDF]
, 2023 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 ...
Ng, Ho-Kuen +2 more
core