Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/57507
Title: Partially composed property of generalized lexicographic product graphs
Authors: Nopparat Pleanmani
Boyko Gyurov
Sayan Panma
Keywords: Mathematics
Issue Date: 1-Dec-2017
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.
URI: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85038122252&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/57507
ISSN: 17938317
17938309
Appears in Collections:CMUL: Journal Articles

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


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