4 papers
On the edge chromatic vertex stability number of graphs
Saeid Alikhani, Mohammad R. Piri
For an arbitrary invariant of a graph , the vertex stability number is the minimum number of vertices of whose removal results in a graph …
Introduction to dominated edge chromatic number of a graph
Mohammad R. Piri, Saeid Alikhani
We introduce and study the dominated edge coloring of a graph. A dominated edge coloring of a graph is a proper edge coloring of such that each color class is dominated by…
Dominated chromatic number of some operations on a graph
Saeid Alikhani, Mohammad R. Piri
Let be a simple graph. The dominated coloring of a graph is a proper coloring of such that each color class is dominated by at least one vertex. The minimum number of c…
On the dominated chromatic number of certain graphs
Saeid Alikhani, Mohammad R. Piri
Let be a simple graph. The dominated coloring of is a proper coloring of such that each color class is dominated by at least one vertex. The minimum number of colors ne…