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 |
---|---|
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 |
Similar Items
-
Partially composed property of generalized lexicographic product graphs
by: Nopparat Pleanmani, et al.
Published: (2018) -
The endomorphism monoids of (n − 3)-regular graphs of order n
by: Nirutt Pipattanajinda, et al.
Published: (2018) -
Determinant of graphs joined by two edges
by: Supot Sookyang, et al.
Published: (2018) -
Isomorphism Conditions for Cayley Graphs of Rectangular Groups
by: Sayan Panma, et al.
Published: (2018) -
On connectedness of cayley graphs of finite transformation semigroups
by: Chunya Tisklang, et al.
Published: (2018)