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 |
| Summary: | © 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. |
|---|