Name
Abstract | ||
|---|---|---|
Suppose the vertices of a graph G were labeled arbitrarily by positive integers, and let S(v) denote the sum of labels over all neighbors of vertex v. A labeling is lucky if the function S is a proper coloring of G, that is, if we have S(u)S(v) whenever u and v are adjacent. The least integer k for which a graph G has a lucky labeling from the set {1,2,...,k} is the lucky number of G, denoted by @h(G). Using algebraic methods we prove that @h(G)= |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.ipl.2009.05.011 | Inf. Process. Lett. |
Keywords | Field | DocType |
lucky labelings,algebraic method,positive integer,proper coloring,graph g,lucky number,integer k,vertex v,information processing,bipartite graph,planar graph,label,maximum,vertex,integer,etiquette,tree | Integer,Discrete mathematics,Graph,Combinatorics,Algebraic number,Vertex (geometry),Bound graph,Lucky number,Bipartite graph,Planar graph,Mathematics | Journal |
Volume | Issue | ISSN |
109 | 18 | 0020-0190 |
Citations | PageRank | References |
8 | 1.35 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sebastian Czerwiński | 1 | 26 | 4.15 |
| Jarosław Grytczuk | 2 | 168 | 18.83 |
| Wiktor Żelazny | 3 | 15 | 2.40 |