The cordiality of the path-union of n copies of a graph
Discrete Mathematics
Saved in:
Main Authors: | Shee, S.-C., Ho, Y.-S. |
---|---|
Other Authors: | MATHEMATICS |
Format: | Article |
Published: |
2014
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/104273 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
The cordiality of one-point union of n copies of a graph
by: Shee, S.-C., et al.
Published: (2014) -
On extremal k-graphs without repeated copies of 2-intersecting edges
by: Ling, Alan C. H., et al.
Published: (2009) -
Some results on λ-valuation of graphs involving complete bipartite graphs
by: Shee, S.-C.
Published: (2014) -
Local polynomial convexity of union of two graphs with CR isolated singularities
by: Kieu, Phuong Chi
Published: (2017) -
Work-efficient parallel union-find with applications to incremental graph connectivity
by: Natcha Simsiri, et al.
Published: (2018)