characterization of product cordial dragon graphs
|
|
|
|
|
|
|
|
نویسنده
|
acharya mukti ,kureethara joseph varghese
|
|
منبع
|
communications in combinatorics and optimization - 2024 - دوره : 9 - شماره : 4 - صفحه:805 -811
|
|
چکیده
|
The vertices of a graph are to be labelled with 0 or 1 such that each edge gets the label as the product of its end vertices. if the number of vertices labelled with 0’s and 1’s differ by at most one and if the number of edges labelled with 0’s and 1’s differ by at most by one, then the labelling is called product cordial labelling. complete characterizations of product cordial dragon graphs are given. we also characterize dragon graphs whose line graphs are product cordial.
|
|
کلیدواژه
|
cordial graph ,binary labeling ,line graph ,dragon graph
|
|
آدرس
|
christ university, department of mathematics, india, christ university, department of mathematics, india
|
|
پست الکترونیکی
|
frjoseph@christuniversity.in
|
|
|
|
|
|
|