Labelling graphs with the circular difference

DOI10.11650/twjm/1500407256zbMath0973.05065OpenAlexW4245375765MaRDI QIDQ1590392

Kun-Feng Wu, Roger K.-C. Yeh

Publication date: 22 October 2001

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/twjm/1500407256

zbMATH Keywords

graph labellingscircular difference

Mathematics Subject Classification ID

Applications of graph theory (05C90) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (10)

Distance-two labelings of digraphs ⋮ Distance two edge labelings of lattices ⋮ The minimum span of \(L(2,1)\)-labelings of generalized flowers ⋮ \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs ⋮ Multiple \(L(j,1)\)-labeling of the triangular lattice ⋮ On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs ⋮ A survey on labeling graphs with a condition at distance two ⋮ On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path ⋮ On \(L(2,1)\)-labelings of Cartesian products of paths and cycles ⋮ Distance-two labelings of graphs

This page was built for publication: Labelling graphs with the circular difference