Temat: edge-subdivision - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs
Autorzy:: Dettlaff, M.
Raczek, J.
Yero, I. G.
Powiązania:: https://bibliotekanauki.pl/articles/255785.pdf
Data publikacji:: 2016
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: domination
paired domination
independent domination
edge subdivision
edge multisubdivision
corona graph
Opis:: Given a graph G = (V, E), the subdivision of an edge e = uv ∈ E(G) means the substitution of the edge e by a vertex x and the new edges ux and xv. The domination subdivision number of a graph G is the minimum number of edges of G which must be subdivided (where each edge can be subdivided at most once) in order to increase the domination number. Also, the domination multisubdivision number of G is the minimum number of subdivisions which must be done in one edge such that the domination number increases. Moreover, the concepts of paired domination and independent domination subdivision (respectively multisubdivision) numbers are denned similarly. In this paper we study the domination, paired domination and independent domination (subdivision and multisubdivision) numbers of the generalized corona graphs.
Źródło:: Opuscula Mathematica; 2016, 36, 5; 575-588
1232-9274
2300-6919
Pojawia się w:: Opuscula Mathematica
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Introduction to dominated edge chromatic number of a graph
Autorzy:: Piri, Mohammad R.
Alikhani, Saeid
Powiązania:: https://bibliotekanauki.pl/articles/2051020.pdf
Data publikacji:: 2021
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: dominated edge chromatic number
subdivision
operation
corona
Opis:: We introduce and study the dominated edge coloring of a graph. A dominated edge coloring of a graph $G$, is a proper edge coloring of $G$ such that each color class is dominated by at least one edge of $G$. The minimum number of colors among all dominated edge coloring is called the dominated edge chromatic number, denoted by $\chi_{dom}^{\prime}(G)$. We obtain some properties of $\chi_{dom}^{\prime}(G)$ and compute it for specific graphs. Also examine the effects on $\chi_{dom}^{\prime}(G)$ when $G$ is modified by operations on vertex and edge of G. Finally, we consider the k-subdivision of G and study the dominated edge chromatic number of these kind of graphs.
Źródło:: Opuscula Mathematica; 2021, 41, 2; 245-257
1232-9274
2300-6919
Pojawia się w:: Opuscula Mathematica
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja