Frequency assignment through combinatorial optimization approach

MaRDI QIDQ5490341zbMATH OpenFDO

Authors Zhendong Shao

Publication date 4 October 2006

zbMATH Keywords

channel assignmentgraph compositiongraph productlabeling

Mathematics Subject Classification ID

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

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₁,d₂)-labeling problem on graphs
• The \(L(2,1)\)-labeling on graphs and the frequency assignment problem

Cited in

(12)

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

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)