Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: dominated edge chromatic number

Sortuj według:

Ogranicz wyniki do:

Introduction to dominated edge chromatic number of a graph

Piri Mohammad R., Alikhani Saeid

Opuscula Mathematica

2021

Vol. 41, no. 2

245--257

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 [formula]. We obtain some properties of [formula] and compute it for specific graphs. Also examine the effects on [formula] 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.