Frequency assignment through combinatorial optimization approach

zbMATH Open1100.05086MaRDI QIDQ5490341FDOQ5490341

Authors: Zhendong Shao 

Publication date: 4 October 2006

Recommendations

• \(L(3,2,1)\)-labeling of graphs
• scientific article; zbMATH DE number 2145257
• Distance constrained labelings of strong product of \(n\) general graphs.
• The \(L(d_1,d_2)\)-labeling problem on graphs
• The \(L(2,1)\)-labeling on graphs and the frequency assignment problem

zbMATH Keywords

labelingchannel assignmentgraph compositiongraph product

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (12)

• Title not available (Why is that?)
• How difficult is the frequency selection problem?
• Distance constrained labelings of strong product of \(n\) general graphs.
• Frequency assignment model of zero divisor graph
• Title not available (Why is that?)
• Optimal \(L(2,1)\)-labeling of Cartesian products of cycles, with an application to independent domination
• \(L(2,1)\)-labeling of interval graphs
• Frequency assignment problem in networks with limited spectrum
• Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two
• The frequency assignment problem: A solution via nonlinear programming
• Frequency assignment problem in satellite communications using differential evolution
• On the \(L(2,1)\)-labelings of amalgamations of graphs

This page was built for publication: Frequency assignment through combinatorial optimization approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5490341)