One edge union of k shell graphs is cordial.
Xi YueYuansheng YangWang LipingPublished in: Ars Comb. (2008)
Keyphrases
- weighted graph
- undirected graph
- edge detection
- minimum spanning trees
- directed graph
- edge weights
- graph theoretic
- graph representation
- graph matching
- edge information
- graph databases
- structured objects
- graph mining
- graph theory
- graph clustering
- random graphs
- adjacency graph
- disjoint paths
- learning algorithm
- graph structure
- edge detector
- labeled graphs
- image processing