Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1261
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | - |
dc.creator | Shan, E | - |
dc.creator | Cheng, TCE | - |
dc.creator | Kang, L | - |
dc.date.accessioned | 2014-12-11T08:23:57Z | - |
dc.date.available | 2014-12-11T08:23:57Z | - |
dc.identifier.issn | 0166-218X | - |
dc.identifier.uri | http://hdl.handle.net/10397/1261 | - |
dc.language.iso | en | en_US |
dc.publisher | Elsevier | en_US |
dc.rights | Discrete Applied Mathematics © 2007 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com. | en_US |
dc.subject | Turán theorem | en_US |
dc.subject | Minus domination | en_US |
dc.subject | Signed domination | en_US |
dc.subject | Clique | en_US |
dc.title | An application of the Turán theorem to domination in graphs | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.description.otherinformation | Author name used in this publication: T.C.E. Cheng | en_US |
dc.identifier.spage | 2712 | - |
dc.identifier.epage | 2718 | - |
dc.identifier.volume | 156 | - |
dc.identifier.issue | 14 | - |
dc.identifier.doi | 10.1016/j.dam.2007.11.008 | - |
dcterms.abstract | A function f:V(G)→{+1,−1} defined on the vertices of a graph G is a signed dominating function if for any vertex v the sum of function values over its closed neighborhood is at least 1. The signed domination number γs(G) of G is the minimum weight of a signed dominating function on G. By simply changing “{+1,−1}” in the above definition to “{+1,0,−1}”, we can define the minus dominating function and the minus domination number of G. In this note, by applying the Turán theorem, we present sharp lower bounds on the signed domination number for a graph containing no (k+1)-cliques. As a result, we generalize a previous result due to Kang et al. on the minus domination number of k-partite graphs to graphs containing no (k+1)-cliques and characterize the extremal graphs. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Discrete applied mathematics, 28 July 2008, v. 156, no. 14, p. 2712–2718 | - |
dcterms.isPartOf | Discrete applied mathematics | - |
dcterms.issued | 2008-07-28 | - |
dc.identifier.isi | WOS:000259889300011 | - |
dc.identifier.scopus | 2-s2.0-50649105496 | - |
dc.identifier.rosgroupid | r43095 | - |
dc.description.ros | 2008-2009 > Academic research: refereed > Publication in refereed journal | - |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
dc.description.pubStatus | Published | en_US |
dc.description.oaCategory | Green (AAM) | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
An application of Turan theorem to domination in graphs1.pdf | Pre-published version | 248.76 kB | Adobe PDF | View/Open |
Page views
193
Last Week
0
0
Last month
Citations as of Oct 13, 2024
Downloads
250
Citations as of Oct 13, 2024
SCOPUSTM
Citations
6
Last Week
0
0
Last month
0
0
Citations as of Oct 17, 2024
WEB OF SCIENCETM
Citations
4
Last Week
0
0
Last month
0
0
Citations as of Oct 17, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.