|
|
|
|
the cartesian product of wheel graph and path graph is antimagic
|
|
|
|
|
|
|
|
نویسنده
|
joseph ancy kandathil ,kureethara joseph varghese
|
|
منبع
|
communications in combinatorics and optimization - 2023 - دوره : 8 - شماره : 4 - صفحه:639 -647
|
|
چکیده
|
Suppose each edge of a simple connected undirected graph is given a unique number from the numbers 1, 2, . . . , q, where q is the number of edges of that graph. then each vertex is labelled with sum of the labels of the edges incident to it. if no two vertices have the same label, then the graph is called an antimagic graph. we prove that the cartesian product of wheel graph and path graph is antimagic.
|
|
کلیدواژه
|
graph labeling ,antimagic labeling ,magic labeling
|
|
آدرس
|
christ university, department of mathematics, india, christ university, department of mathematics, india
|
|
پست الکترونیکی
|
frjoseph@christuniversity.in
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|