Harmonious Coloring of Middle Graph of Quadrilateral Snake Graphs

2021 ◽  
Vol 8 (3) ◽  
pp. 93-97
Keyword(s):  
Middle Graph

scholarly journals The set chromatic numbers of the middle graph of graphs

2021 ◽  
Vol 1836 (1) ◽  
pp. 012014
Author(s):  
G R J Eugenio ◽  
M J P Ruiz ◽  
M A C Tolentino
Keyword(s):  
Chromatic Numbers ◽  
Middle Graph

A modified anti-magic graph labeling for middle graph and total graph related to path

2016 ◽  
Author(s):  
Zareen Tasneem ◽  
Farissa Tafannum ◽  
Maksuda Rahman Anti ◽  
Wali Mohammad Abdullah ◽  
Md. Mahbubur Rahman
Keyword(s):  
Graph Labeling ◽  
Total Graph ◽  
Middle Graph

scholarly journals On k-rainbow domination in middle graphs

2021 ◽  
Author(s):  
Kijung Kim
Keyword(s):  
Minimum Weight ◽  
Domination Number ◽  
Simple Graph ◽  
Upper And Lower Bounds ◽  
Matching Number ◽  
Domatic Number ◽  
Rainbow Domination ◽  
Vertex Set ◽  
Middle Graph ◽  
Dominating Function

Let $G$ be a finite simple graph with vertex set $V(G)$ and edge set $E(G)$. A function $f : V(G) \rightarrow \mathcal{P}(\{1, 2, \dotsc, k\})$ is a \textit{$k$-rainbow dominating function} on $G$ if for each vertex $v \in V(G)$ for which $f(v)= \emptyset$, it holds that $\bigcup_{u \in N(v)}f(u) = \{1, 2, \dotsc, k\}$. The weight of a $k$-rainbow dominating function is the value $\sum_{v \in V(G)}|f(v)|$. The \textit{$k$-rainbow domination number} $\gamma_{rk}(G)$ is the minimum weight of a $k$-rainbow dominating function on $G$. In this paper, we initiate the study of $k$-rainbow domination numbers in middle graphs. We define the concept of a middle $k$-rainbow dominating function, obtain some bounds related to it and determine the middle $3$-rainbow domination number of some classes of graphs. We also provide upper and lower bounds for the middle $3$-rainbow domination number of trees in terms of the matching number. In addition, we determine the $3$-rainbow domatic number for the middle graph of paths and cycles.

scholarly journals ON DYNAMIC COLORING OF WEB GRAPH

2018 ◽  
Vol 5 (2) ◽  
pp. 11-15
Author(s):  
Aaresh R.R ◽  
Venkatachalam M ◽  
Deepa T
Keyword(s):  
Chromatic Number ◽  
Line Graph ◽  
Proper Coloring ◽  
Total Graph ◽  
Web Graph ◽  
Middle Graph

Dynamic coloring of a graph G is a proper coloring. The chromatic number of a graph G is the minimum k such that G has a dynamic coloring with k colors. In this paper we investigate the dynamic chromatic number for the Central graph, Middle graph, Total graph and Line graph of Web graph Wn denoted by C(Wn), M(Wn), T(Wn) and L(Wn) respectively.

scholarly journals On r-dynamic coloring of comb graphs

2021 ◽  
Vol 27 (2) ◽  
pp. 191-200
Author(s):  
K. Kalaiselvi ◽  
◽  
N. Mohanapriya ◽  
J. Vernold Vivin ◽  
◽  
...  
Keyword(s):  
Lower Bound ◽  
Chromatic Number ◽  
Upper Bound ◽  
Line Graph ◽  
Proper Coloring ◽  
Total Graph ◽  
Middle Graph ◽  
Different Color

An r-dynamic coloring of a graph G is a proper coloring of G such that every vertex in V(G) has neighbors in at least $\min\{d(v),r\}$ different color classes. The r-dynamic chromatic number of graph G denoted as $\chi_r (G)$, is the least k such that G has a coloring. In this paper we obtain the r-dynamic chromatic number of the central graph, middle graph, total graph, line graph, para-line graph and sub-division graph of the comb graph $P_n\odot K_1$ denoted by $C(P_n\odot K_1), M(P_n\odot K_1), T(P_n\odot K_1), L(P_n\odot K_1), P(P_n\odot K_1)$ and $S(P_n\odot K_1)$ respectively by finding the upper bound and lower bound for the r-dynamic chromatic number of the Comb graph.

scholarly journals Some New Results on Distance k-Domination in Graphs

2013 ◽  
Vol 2013 ◽  
pp. 1-4
Author(s):  
Samir K. Vaidya ◽  
Nirang J. Kothari
Keyword(s):  
Domination Number ◽  
Total Graph ◽  
Middle Graph ◽  
Domination In Graphs

We determine the distance k-domination number for the total graph, shadow graph, and middle graph of path Pn.

scholarly journals BILANGAN DOMINASI EDGE-VERTEX DAN VERTEX-EDGE PADA GRAF LINTASAN, CYCLE, CENTIPEDE DAN MASING-MASING MIDDLE GRAPHNYA

2019 ◽  
Vol 8 (3) ◽  
Author(s):  
Evi Utami, Evi Noviani Fransiskus Fran
Keyword(s):  
Middle Graph

Sebuah himpunan ,  adalah himpunan dominasi pada graf  jika semua simpul yang tidak berada pada himpunan  bertetangga sedikitnya dengan satu simpul dari  dan kardinalitas minimum dari  disebut bilangan dominasi . Ada banyak jenis bilangan dominasi yang telah dikembangkan diantaranya bilangan dominasi edge-vertex dan bilangan dominasi vertex-edge. Sebuah himpunan  adalah himpunan dominasi edge-vertex jika untuk semua simpul pada  ada sisi  sedemikian sehingga  mendominasi  dan kardinalitas minimum dari  disebut bilangan dominasi edge-vertex . Sebuah himpunan  adalah himpunan dominasi vertex-edge jika untuk semua sisi pada  ada simpul  sedemikian sehingga  mendominasi  dan kardinalitas minimum dari  disebut bilangan dominasi vertex-edge . Hasil dari penelitian diperoleh bilangan dominasi edge-vertex pada graf lintasan, cycle dan centipede serta pada middle graph dari graf tersebut yaitu , , , ,  dan . Bilangan dominasi vertex-edge pada graf lintasan, cycle dan centipede serta pada middle graph dari graf tersebut yaitu , , , ,  dan .  Kata Kunci: bilangan dominasi, edge-vertex, vertex-edge, graf lintasan, cycle, centipede

Sign in / Sign up

Export Citation Format

Share Document