Lexicographic product graphs Pm[Pn] are antimagic.
Wenhui MaGuanghua DongYingyu LuNing WangPublished in: AKCE Int. J. Graphs Comb. (2018)
Keyphrases
- graph theoretic
- petri net
- graph kernels
- graph matching
- graph theory
- product design
- graph mining
- spanning tree
- product quality
- product information
- graph model
- series parallel
- life cycle
- subgraph isomorphism
- cardinality constraints
- data sets
- breadth first search
- graph clustering
- complex structures
- graph databases
- weighted graph
- graph structure