Search
Now showing items 1-10 of 33
Teori Graph, Aplikasi dan Tumbuhnya Keterampilan Berpikir Tingkat TInggi
(2015-05-26)
Kurang lebih satu tahun setengah yang lalu tepatnya tanggal 1 Agustus 2013, saya diamanati jabatan fungsional tertinggi yaitu profesor oleh Menteri Pendidikan dan Kebudayaan RI dalam Matematika Diskrit bidang Combinatorics ...
P2 ▷ H-super antimagic total labeling of comb product of graphs
(2018-04-12)
Let L and H be two simple, nontrivial and undirected graphs. Let o be a vertex of H, the comb product between L and H,
denoted by L ▷ H, is a graph obtained by taking one copy of L and |V(L)| copies of H and grafting the ...
Local Edge Antimagic Coloring of Comb Product of Graphs
(2018-07-03)
All graph in this paper are ¯nite, simple and connected graph. Let
G(V; E) be a graph of vertex set V and edge set E. A bijection f : V (G) ¡!
f1; 2; 3; :::; jV (G)jg is called a local edge antimagic labeling if for any ...
A study of local domination number of Sn H graph
(2018-02-28)
All graphs in this paper are undirected, connected and simple graph. Let G = (V,E) be a graph of order |V| and size |E|. We define a set D as a dominating set if for every vertex μ epsilon V – D is adjacent to some vertex ...
Super (a*, d*)-H-antimagic total covering of second order of shackle graphs
(2018-02-28)
Let H be a simple and connected graph. A shackle of graph H, denoted by
G = shack(H; v; n), is a graph G constructed by non-trivial graphs H
such
that, for every 1 · s; t · n, H
have no a common vertex with js ¡ tj ¸ ...
A Super (A,D)-Bm-Antimagic Total Covering Of Ageneralized Amalgamation Of Fan Graphs
(2018-02-28)
We assume finite, simple and undirected graphs in this study. Let G, H be two graphs. By an (a,d)-H-
antimagic total graph, we mean any obtained bijective function 𝑓 ∶ 𝑉
(
𝐺
)
∪ 𝐸
(
𝐺
)
→ {1, 2, 3, … ...
On the rainbow coloring for some graph operations
(2018-02-28)
Let G = (V, E) be a nontrivial, finite, simple and undirected connected graph on which is defined a coloring f : E(G) → {1,2, …, k}, k ∈ N. The adjacent edges may be colored the same colors. A path in an edge colored graph ...
LOCAL EDGE ANTIMAGIC COLORING OF GRAPHS
(2018-02-28)
All graphs considered in this paper are finite, simple and connected graphs. Let G(V, E) be a graph with the vertex set V and the edge set E, and let w be the edge weight of graph G. Then a bijection f: V (G) → {1, 2, 3, ...
Super local edge antimagic total coloring of Pn . H
(2018-07-04)
In this paper, we consider that all graphs are ¯nite, simple and connected.
Let G(V; E) be a graph of vertex set V and edge set E. A bijection f : V (G) ¡!
f1; 2; 3; :::; jV (G)jg is called a local edge antimagic labeling ...
On the locating domination number of corona product
(2018-07-04)
Let G =(V (G),E(G) be a connected graph and v V (G). A dominating set for a
graph G =(V, E) is a subset D of V such that every vertex not in D is adjacent to at least one
member of D. The domination number γ(G) is the ...