Partially composed property of generalized lexicographic product graphs

• المؤلفون الرئيسيون: Nopparat Pleanmani, Boyko Gyurov, Sayan Panma
• التنسيق: دورية
• منشور في: 2018
• الموضوعات: Mathematics; Agricultural and Biological Sciences; Arts and Humanities
• الوصول للمادة أونلاين: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85038122252&origin=inward; http://cmuir.cmu.ac.th/jspui/handle/6653943832/43447

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