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: Nopparat Pleanmani, Boyko Gyurov, Sayan Panma
格式: 雜誌
出版: 2018
主題:
在線閱讀:https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85038122252&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/57507
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Chiang Mai University