2-Edge connected dominating sets and 2-Connected dominating sets of a graph |
| |
Authors: | Hengzhe Li Yuxing Yang Baoyindureng Wu |
| |
Institution: | 1.College of Mathematics and Information Science,Henan Normal University,Xinxiang,People’s Republic of China;2.College of Mathematics and System Sciences,Xinjiang University,Urumqi,People’s Republic of China |
| |
Abstract: | A \(k\)-connected (resp. \(k\)-edge connected) dominating set \(D\) of a connected graph \(G\) is a subset of \(V(G)\) such that \(GD]\) is \(k\)-connected (resp. \(k\)-edge connected) and each \(v\in V(G)\backslash D\) has at least one neighbor in \(D\). The \(k\) -connected domination number (resp. \(k\) -edge connected domination number) of a graph \(G\) is the minimum size of a \(k\)-connected (resp. \(k\)-edge connected) dominating set of \(G\), and denoted by \(\gamma _k(G)\) (resp. \(\gamma '_k(G)\)). In this paper, we investigate the relation of independence number and 2-connected (resp. 2-edge-connected) domination number, and prove that for a graph \(G\), if it is \(2\)-edge connected, then \(\gamma '_2(G)\le 4\alpha (G)-1\), and it is \(2\)-connected, then \(\gamma _2(G)\le 6\alpha (G)-3\), where \(\alpha (G)\) is the independent number of \(G\). |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|