Pages that link to "Item:Q5928417"

The following pages link to The edge span of distance two labellings of graphs (Q5928417):

Displaying 17 items.

• An \(O(n\log n)\) algorithm for finding edge span of cacti (Q281767) (← links)
• Distance-two labelings of digraphs (Q881579) (← links)
• The \(L(2,1)\)-labeling on Cartesian sum of graphs (Q953888) (← links)
• The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications (Q1003574) (← links)
• On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path (Q1005229) (← links)
• Combinatorial optimization in system configuration design (Q1027725) (← links)
• On \(L(2,1)\)-labelings of Cartesian products of paths and cycles (Q1827783) (← links)
• Distance-two labelings of graphs (Q1869030) (← links)
• Cyclic labellings with constraints at two distances (Q1883626) (← links)
• Recent progress in mathematics and engineering on optimal graph labellings with distance conditions (Q2471056) (← links)
• A survey on labeling graphs with a condition at distance two (Q2497501) (← links)
• Distance three labellings for <i>K</i> _<i>n</i>×<i>K</i> ₂ (Q2855724) (← links)
• Graph labeling and radio channel assignment (Q4242956) (← links)
• DISTANCE TWO LABELING ON THE SQUARE OF A CYCLE (Q5217048) (← links)
• (Q5475521) (← links)
• Good edge-labelling of graphs (Q5916095) (← links)
• \(L(p,q)\)-labeling and integer tension of a graph embedded on torus (Q5963610) (← links)