Pages that link to "Item:Q2724308"

The following pages link to Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination (Q2724308):

Displaying 18 items.

• \(L(d,1)\)-labelings of the edge-path-replacement of a graph (Q386438) (← links)
• \(L(2,1)\)-labelling of generalized prisms (Q415277) (← links)
• Coloring the square of the Cartesian product of two cycles (Q708380) (← links)
• Distance two labelling and direct products of graphs (Q932631) (← links)
• On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path (Q1005229) (← 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)
• On \(L(2,1)\)-labelings of Cartesian products of paths and cycles (Q1827783) (← links)
• Distance-two labelings of graphs (Q1869030) (← links)
• On the \(L(2,1)\)-labelings of amalgamations of graphs (Q1949093) (← links)
• The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs (Q2370433) (← links)
• \(L(p,q)\) labeling of \(d\)-dimensional grids (Q2370453) (← 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)
• \(L(2,1)\)-labelings of Cartesian products of two cycles (Q2492228) (← links)
• A survey on labeling graphs with a condition at distance two (Q2497501) (← links)
• \(L(2,1)\)-labelings of the edge-multiplicity-paths-replacement of a graph (Q5963629) (← links)