Name
Title | ||
|---|---|---|
Labeling Dot-Cartesian and Dot-Lexicographic Product Graphs with a Condition at Distance Two. |
Abstract | ||
|---|---|---|
If $d(x,y)$ denotes the distance between vertices $x$ and $y$ in a graph $G$, then an $L(2,1)$-labeling of a graph $G$ is a function $f$ from vertices of $G$ to nonnegative integers such that $\boldsymbol {\vert f(x) - f(y)\vert \ge 2}$ if $\boldsymbol {d(x,y) = 1}$, and $\boldsymbol {\vert f(x) - f(y)\vert \ge 1}$ if $\boldsymbol {d(x,y) = 2}$. Griggs and Yeh conjectured that for any graph with m... |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1093/comjnl/bxv084 | The Computer Journal |
Keywords | Field | DocType |
frequency assignment,L(2, 1)-labeling,graph product,dot-Cartesian product,dot-lexicographic product | Integer,Indifference graph,Combinatorics,Vertex (geometry),Computer science,Theoretical computer science,Degree (graph theory),Lexicographical order,Conjecture,Edge-graceful labeling,Cartesian coordinate system | Journal |
Volume | Issue | ISSN |
59 | 1 | 0010-4620 |
Citations | PageRank | References |
0 | 0.34 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhendong Shao | 1 | 67 | 8.60 |
| Igor Averbakh | 2 | 699 | 54.76 |
| sandi klavžar | 3 | 542 | 58.66 |