Roman domination and Mycieleski’s structure in graphs

P. Kazemi, Adel (2008) Roman domination and Mycieleski’s structure in graphs. University of Mohaghegh Ardabili.

[img] Text
1.Roman domination and Mycieleski's structure in graphs.tex.pdf

Download (186kB)

Abstract

In this paper first we find the lower and the upper bounds for the Roman domination number of Mycielskian of a graph, μ(G), and then we characterize the graphs that their Roman domination number is the lower bound or the upper bound. Next with knowing the Roman domination number of a special Roman graph G, we find the Roman domination number of the m-Mycielskian of G, μm(G). Finally we give some graphs of these kinds.

Item Type: Other
Persian Title: Roman domination and Mycieleski’s structure in graphs
Persian Abstract: -
Subjects: Research Projects
Divisions: Subjects > Faculty of Basic Sciences > Department of Mathematics
Faculty of Basic Sciences > Department of Mathematics
Date Deposited: 23 Jun 2019 06:42
Last Modified: 23 Jun 2019 06:42
URI: http://repository.uma.ac.ir/id/eprint/8085

Actions (login required)

View Item View Item