ON CONNECTED DOMINATING CRITICAL GRAPH
سال
: 2011
چکیده: A set of vertices S is said to dominate the graph G if for each
v /2 S, there is a vertex u 2 S with u adjacent to v, set S is called
the dominating set in graph G. A dominating set, which induces a
connected subgraph of G, is called connected dominating set. The
smallest cardinality of any such dominating set (connected dominating
set) is called the domination number of G and is denoted by (G)(c(G)).
In this paper, we investigate graphs which are critical in the following
sense: for each v, u 2 V (G) with v not adjacent to u, c(G + uv) < c(G).
Thus G is k − c−critical if c(G) = k and for each edge e /2 E(G), we have
c(G + e) < k.
v /2 S, there is a vertex u 2 S with u adjacent to v, set S is called
the dominating set in graph G. A dominating set, which induces a
connected subgraph of G, is called connected dominating set. The
smallest cardinality of any such dominating set (connected dominating
set) is called the domination number of G and is denoted by (G)(c(G)).
In this paper, we investigate graphs which are critical in the following
sense: for each v, u 2 V (G) with v not adjacent to u, c(G + uv) < c(G).
Thus G is k − c−critical if c(G) = k and for each edge e /2 E(G), we have
c(G + e) < k.
کلیدواژه(گان): Dominating set,Connected dominating critical graph
کالکشن
:
-
آمار بازدید
ON CONNECTED DOMINATING CRITICAL GRAPH
Show full item record
| contributor author | فریدون رهبرنیا | en |
| contributor author | فرزانه ندافان | en |
| contributor author | Freydoon Rahbarnia | fa |
| contributor author | farzaneh nadafan | fa |
| date accessioned | 2020-06-06T14:00:59Z | |
| date available | 2020-06-06T14:00:59Z | |
| date copyright | 2/24/2011 | |
| date issued | 2011 | |
| identifier uri | http://libsearch.um.ac.ir:80/fum/handle/fum/3378939 | |
| description abstract | A set of vertices S is said to dominate the graph G if for each v /2 S, there is a vertex u 2 S with u adjacent to v, set S is called the dominating set in graph G. A dominating set, which induces a connected subgraph of G, is called connected dominating set. The smallest cardinality of any such dominating set (connected dominating set) is called the domination number of G and is denoted by (G)(c(G)). In this paper, we investigate graphs which are critical in the following sense: for each v, u 2 V (G) with v not adjacent to u, c(G + uv) < c(G). Thus G is k − c−critical if c(G) = k and for each edge e /2 E(G), we have c(G + e) < k. | en |
| language | English | |
| title | ON CONNECTED DOMINATING CRITICAL GRAPH | en |
| type | Conference Paper | |
| contenttype | External Fulltext | |
| subject keywords | Dominating set | en |
| subject keywords | Connected dominating critical graph | en |
| identifier link | https://profdoc.um.ac.ir/paper-abstract-1020683.html | |
| conference title | سومین کنفرانس ترکیبیات جبری ایران | fa |
| conference location | اصفهان | fa |
| identifier articleid | 1020683 |