Search
Now showing items 11-14 of 14
Some Families of Tree Are Elegant
(Advances in Mathematics: Scientific Journal 9, 2020-12-04)
An elegant labeling on the graph G with n vertex and m edge is a
one-to-one mapping (injection function) of the vertex set V (G) to the set of non
negative integers {0, 1, 2, 3, . . . , m} such that each edge gets the ...
Report and Recommendation of Implementation Research-Based Learning in Improving Combinatorial Thinking Skills Embedded in Stem Parachute Design Activities Assisted by Ccr (Cloud Classroom)
(Universal Journal of Educational Research, 2020-03-01)
The research aims to compare the advanced
class (experimental class) and traditional class with the
traditional teaching method. This research is concerned
with STEM activity in parachute design. The experiment
class ...
Local Super Antimagic Total Labeling for Vertex Coloring of Graphs
(Symmetry, 2020-11-07)
Let G = (V, E) be a graph with vertex set V and edge set E. A local antimagic
total vertex coloring f of a graph G with vertex-set V and edge-set E is an injective map from
V [ E to {1, 2, ... , |V| + |E|} such that if ...
An Inclusive Local Irregularity Coloring of Graphs
(Advances in Mathematics: Scientific Journal, 2020)
All graph in this paper are connected and simple. Let G = (V, E) be a simple graph, where V (G) is vertex set and E(G) is edge set. The local irregularity vertex coloring of G is l : V (G) → {1, 2, · · · , k} and w : V (G) ...