Distance-two labelings of graphs
A labeling of the vertex set of a graph \(G=(V,E)\) is a mapping \(L: V \rightarrow \{0,1,2,\dots\}\). A labeling \(L\) is called \(L(j,k)\)-labeling, \(j\geq k\), if for any \(\{u,v\} \in E\), \(|L(u)-L(v)|\geq j\) and for any \(u,v\in V \) that are at distance \(2\) in \(G\), \(|L(u)-L(v)|\geq k\). The \(L(j,k)\)-labeling number \(\lambda_{j,k}(G)\) of \(G\) is the minimum \(m\) such that there is an \(L(j,k)\)-labeling \(L\) of \(G\) such that for any \(v\in V\), \(L(v)\leq m\). It is easy to prove that for a graph \(G\) of maximum degree \(\Delta\geq 1 \), \(\lambda_{j,k}(G)\geq j + (\Delta -1)k\). The paper studies the structures of graphs \(G\) with \(\lambda_{j,k}(G)= j + (\Delta -1)k\).
- Aspects of structural combinatorics. (Graph homomorphisms and their use)
- Graph labeling and radio channel assignment
- scientific article; zbMATH DE number 1185300 (Why is no real title available?)
- scientific article; zbMATH DE number 1792593 (Why is no real title available?)
- scientific article; zbMATH DE number 841588 (Why is no real title available?)
- scientific article; zbMATH DE number 881282 (Why is no real title available?)
- scientific article; zbMATH DE number 1409224 (Why is no real title available?)
- scientific article; zbMATH DE number 1439442 (Why is no real title available?)
- scientific article; zbMATH DE number 2197903 (Why is no real title available?)
- Labeling Chordal Graphs: Distance Two Condition
- Labelling Graphs with a Condition at Distance 2
- Labelling graphs with the circular difference
- On \(L(d,1)\)-labelings of graphs
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination
- Relating path coverings to vertex labellings with a condition at distance two
- The $L(2,1)$-Labeling Problem on Graphs
- The edge span of distance two labellings of graphs
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
- A characterization of \(\lambda _{d,1}\)-minimal trees and other attainable classes
- Distance-two labellings of Hamming graphs
- Combinatorial optimization in system configuration design
- Labeling trees with a condition at distance two.
- \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs
- Irreducible no-hole \(L(2, 1)\)-coloring of edge-multiplicity-paths-replacement graph
- On L(2,1)-labelings of Cartesian products of paths and cycles
- A note on exact distance labeling
- On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs
- A new approach on locally checkable problems
- Two-distance-primitive graphs
- On representations of graphs as two-distance sets
- A survey on labeling graphs with a condition at distance two
- A note on distance-\(k\) labeling and \(k\)th powers of graphs
- Distance labeling in graphs (extended abstract)
- L(j,k)-labelings and L(j,k)-edge-labelings of graphs.
- Distance two labeling of the composition of graphs
- L(2,l)-labellings of integer distance graphs
- L(2,1)-labeling in the context of some graph operations
- Distance Labeling for Permutation Graphs
- Distance-2 labeling of threshold graphs
- scientific article; zbMATH DE number 1185300 (Why is no real title available?)
- On Regular Graphs Optimally Labeled with a Condition at Distance Two
- The L(j,k)-edge-labeling problem on graphs.
- Graph distance‐dependent labeling related to code assignment in computer networks
- scientific article; zbMATH DE number 881282 (Why is no real title available?)
- On irreducible no‐hole L(2, 1)‐coloring of trees
- scientific article; zbMATH DE number 7085004 (Why is no real title available?)
- On the L(2, 1)-labelling of block graphs
- scientific article; zbMATH DE number 7637429 (Why is no real title available?)
- L(p,q)-labeling and integer tension of a graph embedded on torus
- Distance-two labelings of digraphs
- L(0,1)-labelling of permutation graphs
- Improved upper bounds on the L(2,1)-labeling of the skew and converse skew product graphs
- The \(L(2,1)\)-labeling on Cartesian sum of graphs
- \(L(j,k)\)-labelling and maximum ordering-degrees for trees
- Labeling graphs with two distance constraints
This page was built for publication: Distance-two labelings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869030)
