connectivity;
network design and communication;
strong and weak domination number;
bondage number;
strong and weak bondage number;
middle graphs;
DOMINATION;
D O I:
10.1134/S0001434613050180
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
Let G = (V (G),E(G)) be a simple graph. A subset S of V (G) is a dominating set of G if, for any vertex v a V (G) - S, there exists some vertex u a S such that uv a E(G). The domination number, denoted by gamma(G), is the cardinality of a minimal dominating set of G. There are several types of domination parameters depending upon the nature of domination and the nature of dominating set. These parameters are bondage, reinforcement, strong-weak domination, strong-weak bondage numbers. In this paper, we first investigate the strong-weak domination number of middle graphs of a graph. Then several results for the bondage, strong-weak bondage number of middle graphs are obtained.
机构:
Ilam Univ, Fac Basic Sci, Dept Math, POB 69315-516, Ilam, IranIlam Univ, Fac Basic Sci, Dept Math, POB 69315-516, Ilam, Iran
Kazemnejad, Farshad
Pahlavsay, Behnaz
论文数: 0引用数: 0
h-index: 0
机构:
Hokkaido Univ, Dept Math, Kita Ku, Kita 10,Nishi 8, Sapporo, Hokkaido 0600810, JapanIlam Univ, Fac Basic Sci, Dept Math, POB 69315-516, Ilam, Iran
Pahlavsay, Behnaz
Palezzato, Elisa
论文数: 0引用数: 0
h-index: 0
机构:
Hokkaido Univ, Dept Math, Kita Ku, Kita 10,Nishi 8, Sapporo, Hokkaido 0600810, JapanIlam Univ, Fac Basic Sci, Dept Math, POB 69315-516, Ilam, Iran
Palezzato, Elisa
Torielli, Michele
论文数: 0引用数: 0
h-index: 0
机构:
Hokkaido Univ, Dept Math, GI CoRE GSB, Kita Ku, Kita 10,Nishi 8, Sapporo, Hokkaido 0600810, JapanIlam Univ, Fac Basic Sci, Dept Math, POB 69315-516, Ilam, Iran