1. CMU Intellectual Repository
  2. Academic Support Units
  3. Chiang Mai University Library
  4. CMUL: Journal Articles
Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/57507
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNopparat Pleanmanien_US
dc.contributor.authorBoyko Gyuroven_US
dc.contributor.authorSayan Panmaen_US
dc.date.accessioned2018-09-05T03:44:08Z-
dc.date.available2018-09-05T03:44:08Z-
dc.date.issued2017-12-01en_US
dc.identifier.issn17938317en_US
dc.identifier.issn17938309en_US
dc.identifier.other2-s2.0-85038122252en_US
dc.identifier.other10.1142/S1793830917500793en_US
dc.identifier.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85038122252&origin=inwarden_US
dc.identifier.urihttp://cmuir.cmu.ac.th/jspui/handle/6653943832/57507-
dc.description.abstract© World Scientific Publishing Company. For a vertex property P and a graph G, a set S of vertices of G is a P-set of G if S ∈ P. The maximum and minimum cardinality of a P-set of G are denoted by MP(G) and mP(G), respectively. If S is a P-set such that its cardinality equals MP(G) or mP(G), we say that S is an MP-set or mP-set of G, respectively. In this paper, we obtain such numbers of generalized lexicographic product graphs in some vertex properties.en_US
dc.subjectMathematicsen_US
dc.titlePartially composed property of generalized lexicographic product graphsen_US
dc.typeJournalen_US
article.title.sourcetitleDiscrete Mathematics, Algorithms and Applicationsen_US
article.volume9en_US
article.stream.affiliationsChiang Mai Universityen_US
article.stream.affiliationsGeorgia Gwinnett Collegeen_US
article.stream.affiliationsCentre of Excellence in Mathematicsen_US
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.
Show simple item record


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