Partially composed property of generalized lexicographic product graphs
© 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 t...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Journal |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85038122252&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/57507 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| id |
th-cmuir.6653943832-57507 |
|---|---|
| record_format |
dspace |
| spelling |
th-cmuir.6653943832-575072018-09-05T03:44:08Z Partially composed property of generalized lexicographic product graphs Nopparat Pleanmani Boyko Gyurov Sayan Panma Mathematics © 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. 2018-09-05T03:44:08Z 2018-09-05T03:44:08Z 2017-12-01 Journal 17938317 17938309 2-s2.0-85038122252 10.1142/S1793830917500793 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85038122252&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/57507 |
| institution |
Chiang Mai University |
| building |
Chiang Mai University Library |
| country |
Thailand |
| collection |
CMU Intellectual Repository |
| topic |
Mathematics |
| spellingShingle |
Mathematics Nopparat Pleanmani Boyko Gyurov Sayan Panma Partially composed property of generalized lexicographic product graphs |
| description |
© 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. |
| format |
Journal |
| author |
Nopparat Pleanmani Boyko Gyurov Sayan Panma |
| author_facet |
Nopparat Pleanmani Boyko Gyurov Sayan Panma |
| author_sort |
Nopparat Pleanmani |
| title |
Partially composed property of generalized lexicographic product graphs |
| title_short |
Partially composed property of generalized lexicographic product graphs |
| title_full |
Partially composed property of generalized lexicographic product graphs |
| title_fullStr |
Partially composed property of generalized lexicographic product graphs |
| title_full_unstemmed |
Partially composed property of generalized lexicographic product graphs |
| title_sort |
partially composed property of generalized lexicographic product graphs |
| publishDate |
2018 |
| url |
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85038122252&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/57507 |
| _version_ |
1681424891677507584 |