Browsing by Subject Labeling algorithm

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 1 to 1 of 1
  • An Algorithm for Graceful Labelings of Certain.pdf.jpg
  • Article


  • Authors: Pambe, Biatch Max; Jay, Bagga; Laure, Pauline Fotso (2014)

  • A graceful labeling of a simple graph G is a one-to-one map f from the vertices of G to the set f0; 1; 2; ; /E(G)jg,such that when each edge xy is assigned the label j f ( x) f (y)j, the resulting set of edge labels is f1; 2; ; /E(G)jg,with no label repeated. We are interested at Truszczynski’s conjecture, that all unicyclic graphs except cycles Cn with n 1(mod 4) or n 2(mod 4), are graceful. Jay Bagga et al. introduced an algorithm to enumerate gracefulla belings of cycles and “sun graphs”. We generalize their algorithm to enumerate all graceful labelings of a class of unicyclic graphs and provide some experimental results.

Browsing by Subject Labeling algorithm

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 1 to 1 of 1
  • An Algorithm for Graceful Labelings of Certain.pdf.jpg
  • Article


  • Authors: Pambe, Biatch Max; Jay, Bagga; Laure, Pauline Fotso (2014)

  • A graceful labeling of a simple graph G is a one-to-one map f from the vertices of G to the set f0; 1; 2; ; /E(G)jg,such that when each edge xy is assigned the label j f ( x) f (y)j, the resulting set of edge labels is f1; 2; ; /E(G)jg,with no label repeated. We are interested at Truszczynski’s conjecture, that all unicyclic graphs except cycles Cn with n 1(mod 4) or n 2(mod 4), are graceful. Jay Bagga et al. introduced an algorithm to enumerate gracefulla belings of cycles and “sun graphs”. We generalize their algorithm to enumerate all graceful labelings of a class of unicyclic graphs and provide some experimental results.