Search
Now showing items 41-50 of 69
Elegant Labeling of Some Graphs
(Journal of Physics: Conference Series, 2020-06-19)
An elegant labeling on graph G with vertices and edges is an injective
(one-to-one) mapping from the set of vertices V (G) to the set of non-negative integers
f0; 1; 2; 3; :::; g in such a way that the set of values ...
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 ...
The Effectiveness of Implementation Research-Based Learning Model of Teaching Integrated With Cloud Classroom (Ccr) to Improving Critical Thinking Skills in an Astronomy Course
(Journal of Physics: Conference Series, 2019-11-01)
The research aims to compares the modern class (experimental class) and traditional
class with the traditional teaching style. Experiment class applies research-based learning methods
integration with Cloud Classroom ...
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 ...
On Total r-Dynamic Coloring of Several Classes of Graphs and Their Related Operations
(roceeding The 1st IBSC: Towards The Extended Use Of Basic Science For Enhancing Health, Environment, Energy And Biotechnology, 2017-08-08)
All graphs in this paper are simple, connected and undirected. Let r, k be natural numbers. By a proper
k-coloring of a graph G, we mean a map c : V (G) → S, where |S| = k, such that any two adjacent vertices receive ...
On The Metric Dimension with Non-isolated Resolving Number of Some Exponential Graph
(Proceeding The 1st IBSC: Towards The Extended Use Of Basic Science For Enhancing Health, Environment, Energy And Biotechnology, 2017-08-08)
Let w, w ∈ G = (V, E). A distance in a simple, undirected and connected graph G, denoted by d(v, w), is the
length of the shortest path between v and w in G. For an ordered set W = {w1, w2, w3, . . . , wk} of vertices and ...
On the Rainbow Vertex Connection Number of Edge Comb of Some Graph
(Proceeding The 1st IBSC: Towards The Extended Use Of Basic Science For Enhancing Health, Environment, Energy And Biotechnology, 2017-08-08)
By an edge comb, we mean a graph formed by combining two graphs G and H, where each edge of graph G is
replaced by the which one edge of graph H, denote by G D H. A vertex colored graph G D H = (V (G D H), E(G D H)) ...
Pewarnaan Sisi r-Dinamis pada Graf Khusus dan Graf Operasi Sakel
(CGANT Journal of Mathematics and Applications, 2021-06-01)
Let G = (V (G), E(G)) be a nontrivial connected graph. The edge coloring is defined as
c : E(G) → {1, 2, ..., k}, k ∈ N, with the condition that no adjacent edges have the same
color. k-color r-dynamic is an edge coloring ...
On the Metric-Location-Domination Number of Some Exponential Graphs
(The International Journal of Health, Education and Social (IJHES), 2019-11-30)
On the Metric-Location-Domination Number of Some Exponential Graphs