Counting the Number of Weakly Connected Dominating Sets of Graphs

被引：0

作者：

Alikhani, Saeid ^{[1
]}

Jahari, Somayeh ^{[1
]}

Mehryar, Mohammad ^{[1
]}

机构：

[1] Yazd Univ, Dept Math, Yazd, Iran

来源：

MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES | 2016年 / 10卷 / 03期

关键词：

Dominating sets; Weakly connected; Path; Cycle;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let G = (V(G); E(G)) be a simple graph. A non-empty set S subset of V (G) is a weakly connected dominating set in G, if the subgraph obtained from G by removing all edges each joining any two vertices in V (G) backslash S is connected. In this paper, we consider some graphs and study the number of their weakly connected dominating sets.

引用

页码：297 / 306

页数：10

共 50 条

[41] Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture [J].

Foucaud, Florent ;

Henning, Michael A. .

ELECTRONIC JOURNAL OF COMBINATORICS, 2016, 23 (03)

[42] Locating-Dominating Sets and Identifying Codes in Graphs of Girth at least 5 [J].

Balbuena, Camino ;

Foucaud, Florent ;

Hansberg, Adriana .

ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (02)

[43] Fair dominating sets of paths [J].

Alikhani, Saeid ;

Safazadeh, Maryam .

JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2023, 44 (05) :855-864

[44] On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks [J].

Wu, J ;

Dai, F ;

Gao, M ;

Stojmenovic, I .

JOURNAL OF COMMUNICATIONS AND NETWORKS, 2002, 4 (01) :59-70

[45] ON MINIMUM WEAKLY CONNECTED INDEPENDENT SETS FOR WIRELESS SENSOR NETWORKS: PROPERTIES AND ENUMERATION ALGORITHM [J].

Bendali, Fatiha ;

Mailfert, Jean ;

Mameri, Djelloul .

RAIRO-OPERATIONS RESEARCH, 2015, 49 (02) :313-334

[46] Improving route discovery in on-demand routing protocols using two-hop connected dominating sets [J].

Department of Computer Science, University of California at Santa Cruz, Santa Cruz, CA 95064, United States ;

不详 ;

不详 .

Ad Hoc Netw., 2006, 4 (509-531) :509-531

[47] Distributed Approximation of Capacitated Dominating Sets [J].

Fabian Kuhn ;

Thomas Moscibroda .

Theory of Computing Systems, 2010, 47 :811-836

[48] Distributed Approximation of Capacitated Dominating Sets [J].

Kuhn, Fabian ;

Moscibroda, Thomas .

THEORY OF COMPUTING SYSTEMS, 2010, 47 (04) :811-836

[49] Distributed Approximation of Capacitated Dominating Sets [J].

Kuhn, Fabian ;

Moscibroda, Thomas .

SPAA'07: PROCEEDINGS OF THE NINETEENTH ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2007, :161-+

[50] A Local Condition on Dominating Cycles in Graphs [J].

CHEN Yufu Department of Mathematics Jinzhou Teachers College Jinzhou LiaoningLI Guojun Department of Mathematics Yantai Teachers College Yantai Shandong .

JournalofSystemsScienceandSystemsEngineering, 1993, (04) :357-362

← 1 2 3 4 5 →