PELABELAN SELIMUT AJAIB SUPER PADA GRAF LINTASAN
| Autor: | Resnawati Resnawati, N Farida, I W Sudarsana |
|---|---|
| Rok vydání: | 2018 |
| Předmět: | |
| Zdroj: | JURNAL ILMIAH MATEMATIKA DAN TERAPAN. 15:118-129 |
| ISSN: | 2540-766X 1829-8133 |
| DOI: | 10.22487/2540766x.2018.v15.i2.11347 |
| Popis: | Let 𝐺 = (𝑉, 𝐸) be a simple graph. An edge covering of 𝐺 is a family of subgraphs 𝐻1 , … , 𝐻𝑘 such that each edge of 𝐸(𝐺) belongs to at least one of the subgraphs 𝐻𝑖 , 1 ≤ 𝑖 ≤ 𝑘. If every 𝐻𝑖 is isomorphic to a given graph 𝐻, then the graph 𝐺 admits an 𝐻 − covering. Let 𝐺 be a containing a covering 𝐻, and 𝑓 the bijectif function 𝑓: (𝑉 ∪ 𝐸) → {1,2,3, … , |𝑉| + |𝐸|} is said an 𝐻 −magic labeling of 𝐺 if for every subgraph 𝐻 ′ = (𝑉 ′ ,𝐸 ′ ) of 𝐺 isomorphic to 𝐻, is obtained that ∑ 𝑓(𝑉) + ∑ 𝑓(𝐸) 𝑒∈𝐸(𝐻′ 𝑣∈𝑉(𝐻 ) ′ ) is constant. 𝐺 is said to be 𝐻 −super magic if 𝑓(𝑉) = {1, 2, 3, … , |𝑉|}. In this case, the graph 𝐺 which can be labeled with 𝐻-magic is called the covering graph 𝐻 −magic. The sum of all vertex labels and all edge labels on the covering 𝐻 − super magic then obtained constant magic is denoted by ∑ 𝑓(𝐻). The duplication graph 2 of graph 𝐷2 (𝐺) is a graph obtained from two copies of graph 𝐺, called 𝐺 and 𝐺 ′ , with connecting each respectively vertex 𝑣 in 𝐺 with the vertexs immediate neighboring of 𝑣 ′ in 𝐺 ′ . The purpose of this study is to obtain a covering super magic labeling for of 𝐷2 (𝑃𝑚) on (𝐷2 (𝑃𝑛 )) for 𝑛 ≥ 4 and 3 ≤ 𝑚 ≤ 𝑛 − 1. In this paper, we have showed that duplication path graph (𝐷2 (𝑃𝑛 )) has 𝐷2 (𝑃𝑚) covering super magic labeling for 𝑛 ≥ 4 and 3 ≤ 𝑚 ≤ 𝑛 − 1 with constant magic for all covering is ∑ 𝑓(𝐷2 (𝑃𝑚) (𝑠) ) = ∑ 𝑓(𝐷2 (𝑃𝑚) (𝑠+1) ) |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|