Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Labeling On Pentagonal Pyramidal Graceful Graph
View through CrossRef
Numbers that can be expressed as (r
2
(r+1)) /2 for
all r ≥ 1 are called pentagonal pyramidal numbers. Assume G to be a
graph with p vertices and q edges. Let Φ: V(G) →{0, 1, 2… B
c
} where B
c
is the c
ℎ
number with a pentagonal pyramid, be an injective
function. Define the function Φ* :E(G) →{1,6,18,.., B
c
} such that Φ * (ab) = |Φ(a)- Φ(b)| which is true for
each and every edge abϵE(G). If Φ*(E(G)) represents a sequential
arrangement of non-identical successive pentagonal pyramidal numbers {B
1
, B
2
, …, B
c
},
then Φ can be regarded as the pentagonal pyramidal graceful labeling.
The graph permitting labeling of such kind can be referred to as a
pentagonal pyramidal graceful graph. This study examines some unique
pentagonal pyramidal elegant graph labeling outcomes.
Title: Labeling On Pentagonal Pyramidal Graceful Graph
Description:
Numbers that can be expressed as (r
2
(r+1)) /2 for
all r ≥ 1 are called pentagonal pyramidal numbers.
Assume G to be a
graph with p vertices and q edges.
Let Φ: V(G) →{0, 1, 2… B
c
} where B
c
is the c
ℎ
number with a pentagonal pyramid, be an injective
function.
Define the function Φ* :E(G) →{1,6,18,.
, B
c
} such that Φ * (ab) = |Φ(a)- Φ(b)| which is true for
each and every edge abϵE(G).
If Φ*(E(G)) represents a sequential
arrangement of non-identical successive pentagonal pyramidal numbers {B
1
, B
2
, …, B
c
},
then Φ can be regarded as the pentagonal pyramidal graceful labeling.
The graph permitting labeling of such kind can be referred to as a
pentagonal pyramidal graceful graph.
This study examines some unique
pentagonal pyramidal elegant graph labeling outcomes.
Related Results
Super fibonacci graceful anti – magic labeling for flower graphs and python coding
Super fibonacci graceful anti – magic labeling for flower graphs and python coding
A graph vertices and edges. A super fibonacci graceful anti-magic labeling of is an injective function such that the induced edge labeling is a bijection onto the set In ad...
Fibonacci Prime Labelling on the Class of Flower Graphs
Fibonacci Prime Labelling on the Class of Flower Graphs
Graph labeling is one of the significant topics in graph theory. One of its interesting variants is Fibonacci prime labeling, a special type of labeling that assigns Fibonacci numb...
Graph convolutional neural networks for 3D data analysis
Graph convolutional neural networks for 3D data analysis
(English) Deep Learning allows the extraction of complex features directly from raw input data, eliminating the need for hand-crafted features from the classical Machine Learning p...
E-Cordial Labeling of Some Families of Graphs
E-Cordial Labeling of Some Families of Graphs
An E-cordial labeling σ: E →{0,1} induces σ∗: V →{0,1} on graph G=(V,E), where (σ(v)=(∑_(u∈V)▒〖σ(uv)〗) mod 2 is taken over all edges uv∈E, and the labelling satisfies the condition...
Paley, Cubic Paley, Quadruple Paley, and Generalized Paley Graphs with an Edge-Graceful Labeling
Paley, Cubic Paley, Quadruple Paley, and Generalized Paley Graphs with an Edge-Graceful Labeling
The Paley graph Pq is a simple connected strongly regular graph with (q, q−1/2 , q−5/4 , q−1/4 ) as its parameters, where V (Pq) is the finite field Fq of order q = pn, p is an odd...
On the Graceful Game
On the Graceful Game
A graceful labeling of a graph G with m edges consists in labeling the vertices of G with distinct integers from 0 to m such that, when each edge is assigned the absolute differenc...
Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>
Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>
Penelitian ini bertujuan menentukan bilangan terhubung titik pelangi (rainbow vertex connection number) pada graf garis dan graf tengah yang diperoleh dari hasil operasi comb antar...
k-super cube root cube mean labeling of graphs
k-super cube root cube mean labeling of graphs
Consider a graph G with |V (G)| = p and |E(G)| = q and let f : V (G) → {k, k + 1, k + 2, . . . p + q + k − 1}} be an injective function. The induced edge labeling f ∗ for a vertex ...