1. DSpace at My University
  2. Scientific Published Papers
  3. Applied science faculty
Please use this identifier to cite or link to this item: https://scholar.ptuk.edu.ps/handle/123456789/206
cc-by
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNazzal, Khalida-
dc.contributor.authorAlzahar, Mohamed-
dc.contributor.authorKhamis, Suheir-
dc.date.accessioned2019-01-23T20:32:21Z-
dc.date.available2019-01-23T20:32:21Z-
dc.date.issued2007-01-30-
dc.identifier.citationDiscrete Applied Math. Vol.155 (2007) 515-522.en_US
dc.identifier.urihttps://scholar.ptuk.edu.ps/handle/123456789/206-
dc.descriptionArticleen_US
dc.description.abstractLet (G)denote the domination number of a graphGand letCn Gdenote the cartesian product ofCn, the cycle of lengthn 3,andG. In this paper, we are mainly concerned with the question: which connected nontrivial graphs satisfy (Cn G)= (Cn) (G)?We prove that this equality can only hold ifn≡1 (mod 3). In addition, we characterize graphs which satisfy this equality whenn=4 and provide infinite classes of graphs for generaln≡1 (mod 3).© 2006 Elsevier B.V. All rights reserve (17) (PDF) On the domination number of the cartesian product of the cycle of length n and any graph. Available from: https://www.researchgate.net/publication/223234341_On_the_domination_number_of_the_cartesian_product_of_the_cycle_of_length_n_and_any_graph [accessed Jan 23 2019].en_US
dc.language.isoenen_US
dc.publisherelsevier.en_US
dc.relation.ispartofseriesVol.155;515-522.-
dc.subjectDomination number; Cartesian product; Vizing’s conjectureen_US
dc.titleOn the domination number of the Cartesian product of the cycle of length n and any graph,en_US
dc.typeArticleen_US
Appears in Collections:Applied science faculty

Files in This Item:
File Description SizeFormat 
Onthedominationnumberofthecartesianproductofthecycleof.pdf320.28 kBAdobe PDFThumbnail
View/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.