Creative Thinking in Mathematics

to Improve the Proof of

Graph Labeling Theorems
Creative Thinking in Mathematics to Improve
the Proof of Graph Labelling Theorems

OUTLINE
Mathematics and its terms

Graph and Graph Labeling

Creative Thinking in Mathematics

Creative Thinking and the Proof of Theorem

Mathematics and its terms

Corollary

Postulate

Theorem
Mathematics

Conjecture

Lemma Axiom 3
Mathematics and its terms

Axiom An absolute true statement.

A statement that is accepted as true without having to
Postulate
formally prove it.
A mathematical statement that is proved using precise
and accurate mathematical reasoning.
Theorem
In a mathematical paper, the term theorem is often reserved for the
most important results.
A minor result whose sole purpose is to help in proving a
Lemma
theorem.
A result in which the (usually short) proof relies heavily on
Corollary
a given theorem.
4
Conjecture A mathematical statement which have not proven yet
Graph and Graph Labelling

Description

A graph is a mathematical diagram representation of a network, it describes

the relationship between vertices by edges. We use notation G = (V,E) which V
is a set of vertices and E is a set of edges.

5
Graph and Graph Labelling

Description

Graph labeling has a wide application

11
in various fields, such as x-ray, radar,
1
6
7 10
3 crystallography, coding theory,
cryptography, astronomy,
8 9 transmission, network
communication, and technology.
5 4

Implementation graph labeling i.e. :

• Wallis (2001) : assigning addresses of communications network. 6
• E.T. Baskoro, et.al (2004, 2005) : secret sharing scheme.
Graph and Graph Labelling

Description

Let 𝐻 be a graph. A simple graph 𝐺 = 𝑉, 𝐸 admits an 𝐻 - 𝑐𝑜𝑣𝑒𝑟𝑖𝑛𝑔

if every edge in 𝐸 belongs to a subgraph of 𝐺 that is isomorphic to 𝐻.

𝐺: 𝑇𝑟𝑒𝑒 𝑜𝑟𝑑𝑒r 8

𝐻 ≅ P3 𝐻 ≅ K1,3

P3- 𝑐𝑜𝑣𝑒𝑟𝑖𝑛𝑔 Not K1,3- 𝑐𝑜𝑣𝑒𝑟𝑖𝑛𝑔

That 𝐺 is called 𝑯- 𝑚𝑎𝑔𝑖𝑐 if there is a total labeling

𝑓: 𝑉 ∪ 𝐸 → 1, 2, ⋯ , 𝑉 + 𝐸 such that
for each subgraph 𝐻′ = 𝑉 ′ , 𝐸 ′ of 𝐺 that is isomorphic to 𝐻, 7
σ𝑣∈𝑉 𝑓 𝑣 + σ𝑒∈𝐸 𝑓 𝑒 is constant.
When 𝑓 𝑉 = 1, 2, ⋯ , 𝑉 , that 𝐺 is 𝑯- 𝑠𝑢𝑝𝑒𝑟𝑚𝑎𝑔𝑖𝑐.
Graph and Graph Labelling

Description
𝐺: 𝑇𝑟𝑒𝑒 𝑜𝑟𝑑𝑒r 8.
𝐻 ≅ 𝑃3 7 8

2 9 8 2 7 9

1 14 6 5 1 14 10 6

15 11 13 10 15 5 3 11

4 3 12 13

12 4
8
𝑃𝟑 - 𝑚𝑎𝑔𝑖𝑐 with 𝑓 𝑃𝟑 = 43 𝑃𝟑 - 𝒔𝒖𝒑𝒆𝒓𝑚𝑎𝑔𝑖𝑐 with 𝑓 𝑃𝟑 = 37
Graph and Graph Labelling

𝑂𝑝𝑒𝑛 𝑃𝑟𝑜𝑏𝑙𝑒𝑚𝑠

How to prove that some graphs

obtain (magic or supermagic)
labeling for certain subgraphs?

9
Graph and Graph Labelling

P3-supermagic of Š (4, 3). 10

(T.K. Maryati et.al, JCMCC 2008)

Graph and Graph Labelling

(T.K. Maryati et.al, Utilitas Math 2010)

Shack(G1, G2, G3, G4)

11
How to prove this theorem?
Creative Thinking in Mathematics

(Paul Torrance, 1994)

The ability to produce many relevant

ideas or answers.
Fluency

The ability to change of the ways

Flexibility
or approaches.

Creative
Thinking
Originality
The ability to give different
answers with others.

Elaboration 12
The ability to expand an idea
Creative Thinking and the Proof of Theorem

Fluency - The ability to produce many relevant ideas or answers.

Old proof New proof
Using fixed vertex or fixed edge to put Using sub graph to put some certain
specific numbers. numbers.

Flexibility - The ability to change of the ways or approaches.

Old proof
• The labeling process begins with
putting some numbers as labels on the
graph based on certain sub graph.
• Check the constancy result of the sum
of labeled vertices and edges for each
sub graph.
New proof
• Before the labeling process, we use
𝑘, 𝜃 -balanced multiset for some set or
multiset of numbers by some lemmas.
We have a constant number from the
sum of the elements of each subset.
• During the labeling process, the
13
numbers which we obtained are put
on certain sub graph.
Creative Thinking and the Proof of Theorem

Originality - The ability to give different answers with others.

1. Create a new technique

We create 𝑘, 𝜃 -balanced multiset, a technique of partitioning the set of numbers
such that all subsets have the same cardinality and the sum of the elements of each
subset is constant.
2. Create a new definition of graph
We create Shack (𝐺1 , 𝐺2 , 𝐺3 , … ),
if there exist k isomorphic of G
then we name it Shack (𝐺, 𝑘). Shack(G1, G2, G3, G4)

14

(T.K. Maryati et.al, Discrette Math 2013)

Creative Thinking and the Proof of Theorem

Elaboration - The ability to expand an idea.

1. Using multiset
Multiset allows two or more same
numbers as its element.

2. Using Lemma
Lemma is used as a tool to process
sets or multisets with (𝑘, 𝜃)-
balanced multiset. That Lemma is
allowed to be used repeatedly in
the proof.

15

(T.K. Maryati et.al, Utilitas Math 2010)

Creative Thinking and the Proof of Theorem

(T.K. Maryati et.al, Utilitas Math 2010)

Proof.
An example

16
K2,3 –supermagic labelling of Shack(K2,3, 5)
Creative Thinking and the Proof of Theorem

17
Creative Thinking and the Proof of Theorem

Proof with technique of

(𝑘, 𝜃)-balanced multiset

Anti-(super)magic Total face coloring on

labelling the graph

18
 The fundamental of mathematical learning is
the ability to think and reason mathematically.
With this concern, it will be easier to grow more
creative thinking in mathematics.

Creative thinking will be useful if you implement it.

Creativity can be implemented by believe and action.

Tita Khalis Maryati