Distance two labelling and direct products of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1792593 (Why is no real title available?)
- scientific article; zbMATH DE number 1439442 (Why is no real title available?)
- Labeling Chordal Graphs: Distance Two Condition
- Labeling products of complete graphs with a condition at distance two
- Labelling Graphs with a Condition at Distance 2
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
- 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
Cited in
(10)- Addressing graph products and distance-regular graphs
- Lambda number for the direct product of some family of graphs
- Radio number for the product of a path and a complete graph
- THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE
- L(2, 1)-labellings for direct products of a triangle and a cycle
- \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs
- Distance three labelings for direct products of three complete graphs
- \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle
- On labeling the vertices of products of complete graphs with distance constraints
- On circular-L(2, 1)-labellings of products of graphs
This page was built for publication: Distance two labelling and direct products of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932631)
