\(L(2,1)\)-labelings of the edge-multiplicity-paths-replacement of a graph
From MaRDI portal
Publication:5963629
DOI10.1007/s10878-014-9761-xzbMath1341.90136MaRDI QIDQ5963629
Publication date: 23 February 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9761-x
90C35: Programming involving graphs or networks
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- \(L(d,1)\)-labelings of the edge-path-replacement of a graph
- \(L(2,1)\)-labeling of direct product of paths and cycles
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
- \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs
- \(L(2,1)\)-labelings of Cartesian products of two cycles
- Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
- Labeling Products of Complete Graphs with a Condition at Distance Two
- Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination
- Labelling Graphs with a Condition at Distance 2
- Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
- On labeling the vertices of products of complete graphs with distance constraints
- On the $\lambda$-Number of $Q_n $ and Related Graphs