| dc.contributor.author | Roslan, Hasni@Abdullah | |
| dc.contributor.author | S.M., Sheikholeslami | |
| dc.contributor.author | M. Hadi, Akhbari | |
| dc.date.accessioned | 2010-11-23T01:22:53Z | |
| dc.date.available | 2010-11-23T01:22:53Z | |
| dc.date.issued | 2010-06-02 | |
| dc.identifier.citation | p.1 | en_US |
| dc.identifier.uri | http://dspace.unimap.edu.my/123456789/10252 | |
| dc.description | 1st Regional Conference on Applied and Engineering Mathematics (RCAEM-I) 2010 organized by Universiti Malaysia Perlis (UniMAP) and co-organized by Universiti Sains Malaysia (USM) & Universiti Kebangsaan Malaysia (UKM), 2nd - 3rd June 2010 at Eastern & Oriental Hotel, Penang. | en_US |
| dc.description.abstract | Many problems in extremal graph theory seek the extreme values of graph parameters
on families of graphs. Results of Nordhaus-Gaddum type study the extreme values of the
sum (or product) of a parameter on a graph and its complement, following the classic
paper of Nordhaus and Gaddum solving these problems for the chromatic number on n-
vertex graphs. In this paper, we study such problems for the doubly connected domination
number. A set S of vertices of a connected graph G is a doubly connected dominating set
if every vertex not in S is adjacent to some vertex in S and the subgraphs induced by S and
V - S are connected. The doubly connected domination number
cc(G) is the minimum
size of such a set. We prove that when G and G are both connected of order n,
cc(G) +
cc(G) n + 2 and we describe the two in nite families of extremal graphs achieving the
bound. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Universiti Malaysia Perlis (UniMAP) | en_US |
| dc.relation.ispartofseries | Proceedings of the 1st Regional Conference on Applied and Engineering Mathematics (RCAEM-I) 2010 | en_US |
| dc.subject | Regional Conference on Applied and Engineering Mathematics (RCAEM) | en_US |
| dc.subject | Nordhaus | en_US |
| dc.subject | Gaddum | en_US |
| dc.title | Inequalities of Nordhausgaddum type for doubly connected domination | en_US |
| dc.type | Working Paper | en_US |
| dc.publisher.department | Institut Matematik Kejuruteraan | en_US |
| dc.contributor.url | hroslan@cs.usm.my | en_US |
| dc.contributor.url | s.m.sheikholeslame@azaruniv.edu | en_US |
| dc.contributor.url | hadiakhbari@gmail.com | en_US |
