Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Skolem Graceful Labelin on Broom Graph
View through CrossRef
Let G=(V,E) be a finite simple graph. Broom graph B_(m,n) consist of (m+n) nodes is a path graph P_m with m nodes and a star graph S_n with (n+1) nodes, which are aligned at 1 vertex is the endpoint of the path graph and the center point of the star graph. Skolem graceful labeling is two functions with the rule that the injective function f:V→{1,2,…,|V|} which induces a bijective function g:E→{1,2,…|E|}| such that g(e)=|f(u)-f(v)|, where u,v∈V, and e={u,v}∈E. In this research, broom graph admit skolem graceful labeling with m is odd and even.
Universitas Sumatera Utara
Title: Skolem Graceful Labelin on Broom Graph
Description:
Let G=(V,E) be a finite simple graph.
Broom graph B_(m,n) consist of (m+n) nodes is a path graph P_m with m nodes and a star graph S_n with (n+1) nodes, which are aligned at 1 vertex is the endpoint of the path graph and the center point of the star graph.
Skolem graceful labeling is two functions with the rule that the injective function f:V→{1,2,…,|V|} which induces a bijective function g:E→{1,2,…|E|}| such that g(e)=|f(u)-f(v)|, where u,v∈V, and e={u,v}∈E.
In this research, broom graph admit skolem graceful labeling with m is odd and even.
Related Results
Pelabelan skolem graceful pada graf (S_n,r)
Pelabelan skolem graceful pada graf (S_n,r)
Pelabelan pada suatu graph adalah pemetaan yang memetakan unsur-unsur graph yaitu himpunan titik, himpunan sisi, maupun himpunan titik dan sisi ke suatu bilangan asli dengan aturan...
Skolem, Thoralf (1887–1963)
Skolem, Thoralf (1887–1963)
The twentieth-century mathematician Thoralf Skolem is known principally for two achievements. The first is the statement and proof of the Löwenheim-Skolem theorem. The second is hi...
Thoralf Skolem
Thoralf Skolem
Abstract
This item is a handwritten letter, dated 1 November 1931, addressed to a “Sehr geehrter Herr Professor.” From the contents of the letter, in particular from...
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...
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...
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 Robustness for the Skolem, Positivity and Ultimate Positivity Problems
On Robustness for the Skolem, Positivity and Ultimate Positivity Problems
The Skolem problem is a long-standing open problem in linear dynamical
systems: can a linear recurrence sequence (LRS) ever reach 0 from a given
initial configuration? Similarly, t...
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...