Telechargement Cordial 2012 Crack
0 views
Skip to first unread message
Message has been deleted
Napoleon Hauck
Jul 15, 2024, 2:15:21 AM7/15/24
to procunresri
A graph is said to be cordial if it has a 0-1 labeling that satisfies certain properties. In this paper we show the Cartesian product of a path and a cycle or vice versa are always cordial under some conditions. Also, we prove that the Cartesian product of two paths is cordial.
Reply all
Reply to author
Forward
0 new messages