One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial.

G. Sethuraman P. Selvaraju

Published in: Discret. Math. (2002)

Keyphrases

bipartite graph
edge weights
maximum cardinality
minimum weight
graph clustering
maximum matching
graph model
link prediction
undirected graph
labeled graphs
weighted graph
directed graph
maximum weight
bipartite networks
bipartite graph matching
minimum spanning tree
vertex set
approximation algorithms