arXiv Analytics

Sign in

arXiv:2001.00756 [math.CO]AbstractReferencesReviewsResources

The study of odd graceful and odd strongly harmonious for bipartite graph

Xiuying Wang, Ying Zhoua, Haihong Wanga, Chunfeng Liu

Published 2020-01-03Version 1

In this paper, we investigate odd graceful graph, odd strongly harmonious graph, bipartite graph and their relationship. We proved following results: (1) if G is odd strongly harmonious graph, then G is odd graceful graph ;(2) if G is bipartite odd graceful graph, then G is odd strongly harmonious graph.

Related articles: Most relevant | Search more
arXiv:1306.1763 [math.CO] (Published 2013-06-07, updated 2013-10-04)
Bipartite graphs are weak antimagic
arXiv:1611.06535 [math.CO] (Published 2016-11-20)
Inverses of Bipartite Graphs
arXiv:2009.06688 [math.CO] (Published 2020-09-14)
On the number of spanning trees in bipartite graphs