Cover Image

Inequalities of Nordhausgaddum type for doubly connected domination

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.

Saved in:
Bibliographic Details
Main Authors: Roslan, Hasni@Abdullah, S.M., Sheikholeslami, M. Hadi, Akhbari
Other Authors: hroslan@cs.usm.my
Format: Working Paper
Language:English
Published: Universiti Malaysia Perlis (UniMAP) 2010
Subjects:
Regional Conference on Applied and Engineering Mathematics (RCAEM)
Nordhaus
Gaddum
Online Access:http://dspace.unimap.edu.my/xmlui/handle/123456789/10252
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.unimap-10252
record_format dspace
spelling my.unimap-102522010-11-23T01:22:53Z Inequalities of Nordhausgaddum type for doubly connected domination Roslan, Hasni@Abdullah S.M., Sheikholeslami M. Hadi, Akhbari hroslan@cs.usm.my s.m.sheikholeslame@azaruniv.edu hadiakhbari@gmail.com Regional Conference on Applied and Engineering Mathematics (RCAEM) Nordhaus Gaddum 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. 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. 2010-11-23T01:22:53Z 2010-11-23T01:22:53Z 2010-06-02 Working Paper p.1 http://hdl.handle.net/123456789/10252 en Proceedings of the 1st Regional Conference on Applied and Engineering Mathematics (RCAEM-I) 2010 Universiti Malaysia Perlis (UniMAP) Institut Matematik Kejuruteraan
institution Universiti Malaysia Perlis
building UniMAP Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Malaysia Perlis
content_source UniMAP Library Digital Repository
url_provider http://dspace.unimap.edu.my/
language English
topic Regional Conference on Applied and Engineering Mathematics (RCAEM)
Nordhaus
Gaddum
spellingShingle Regional Conference on Applied and Engineering Mathematics (RCAEM)
Nordhaus
Gaddum
Roslan, Hasni@Abdullah
S.M., Sheikholeslami
M. Hadi, Akhbari
Inequalities of Nordhausgaddum type for doubly connected domination
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.
author2 hroslan@cs.usm.my
author_facet hroslan@cs.usm.my
Roslan, Hasni@Abdullah
S.M., Sheikholeslami
M. Hadi, Akhbari
format Working Paper
author Roslan, Hasni@Abdullah
S.M., Sheikholeslami
M. Hadi, Akhbari
author_sort Roslan, Hasni@Abdullah
title Inequalities of Nordhausgaddum type for doubly connected domination
title_short Inequalities of Nordhausgaddum type for doubly connected domination
title_full Inequalities of Nordhausgaddum type for doubly connected domination
title_fullStr Inequalities of Nordhausgaddum type for doubly connected domination
title_full_unstemmed Inequalities of Nordhausgaddum type for doubly connected domination
title_sort inequalities of nordhausgaddum type for doubly connected domination
publisher Universiti Malaysia Perlis (UniMAP)
publishDate 2010
url http://dspace.unimap.edu.my/xmlui/handle/123456789/10252
_version_ 1643789779879329792
score 13.214268

Similar Items