The graph relabeling problem and its variants
Graph labeling is a classic problem in mathematics and computing. In this paper we study an interesting set of graph labeling problems which were first introduced by Kantabutra [12]. The general problem, here called the GRAPH RELABELING PROBLEM, is to take an undirected graph G = (V, E), two labelin...
محفوظ في:
المؤلفون الرئيسيون: | , , |
---|---|
التنسيق: | Conference or Workshop Item |
اللغة: | English |
منشور في: |
2014
|
الوصول للمادة أونلاين: | http://www.scopus.com/inward/record.url?eid=2-s2.0-52949107176&partnerID=40&md5=6eb3285463f32b7f8578ac4937b8b2f9 http://cmuir.cmu.ac.th/handle/6653943832/5468 |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|