Pages that link to "Item:Q4540142"

The following pages link to Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment] (Q4540142):

Displaying 15 items.

• \(L(d,1)\)-labelings of the edge-path-replacement of a graph (Q386438) (← links)
• \(L(2,1)\)-labelling of generalized prisms (Q415277) (← links)
• Distance two labelling and direct products of graphs (Q932631) (← links)
• \(L(j,k)\)-labelling and maximum ordering-degrees for trees (Q968198) (← links)
• \(L(2,1)\)-labeling of strong products of cycles (Q1041747) (← links)
• Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers (Q1406039) (← links)
• \(L(2,1)\)-labeling of direct product of paths and cycles (Q1764815) (← links)
• The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs (Q2370433) (← links)
• \(L(j, k)\)-number of direct product of path and cycle (Q2391993) (← links)
• \(L(2, 1)\)-labelings of the edge-path-replacement of a graph (Q2392735) (← links)
• \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs (Q2471059) (← links)
• A survey on labeling graphs with a condition at distance two (Q2497501) (← links)
• Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles (Q2576352) (← links)
• \(L(2,1)\)-labelings of the edge-multiplicity-paths-replacement of a graph (Q5963629) (← links)
• \(L(2,1)\)-labeling for brick product graphs (Q5963632) (← links)