Search
Now showing items 41-50 of 50
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)) ...
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
On super (a, d) − P2 B H− antimagic total labeling of disjoint union of comb product graphs
(antimagic total labeling of disjoint union of comb product graphs, 2019-05-07)
This study focuses on simple and undirected graphs. For a graph G = (V, E), a bijection
λ from V (G)∪E(G) into {1, 2, ..., |V (G)|+|E(G)|} is called super (a, d)-H-antimagic total
labeling of G if the total P2BH−weights, ...
Vertex colouring using the adjacency matrix
(ICCGANT, 2018-11-24)
Recently, graph theory is one of the most rapidly developing sciences. Graphs in its
applications are generally used to represent discrete objects and relationships between these
objects. The visual representation of a ...
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) ...
Super (a, d)-Edge Antimagic Total Labeling of Connected Ferris Wheel Graph
(Jurnal Ilmu Dasar, 2014-07-01)
Let G be a simple graph of order p and size q. Graph G is called an (a,d)-edge-antimagic
total if there exist a bijection f : V (G) ∪ E(G) → {1, 2,...,p + q} such that the edge-weights, w(uv) =
f(u)+f(v)+f(uv); u, v ∈ V ...
Pengembangan Perangkat Pembelajaran Matematika Berbasis Karakter dengan Cooperative Learning Tipe Student Team Achievement Divisions (STAD) Sub Pokok Bahasan Logika Matematika Kelas X Rekayasa Perangkat Lunak (RPL)
(Pancaran, Vol. 4, No. 2, hal 135-142, Mei 2015, 2015-05-01)
The research purpose is to know the process and result of the development of
mathematics learning materials based on character by cooperative learning of student
teams achievement divisions (stad) type for logic mathematics ...