Star matching and distance two labelling

DOI10.11650/twjm/1500405279zbMath1173.05016OpenAlexW4214759200MaRDI QIDQ1025703

Wensong Lin, Peter Che Bor Lam

Publication date: 23 June 2009

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

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

zbMATH Keywords

Hamiltonian pathdirect productpath covering\(L(2,1)\)-labellingMycielskian of a graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Broadcasting in split graphs ⋮ On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs ⋮ On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs

This page was built for publication: Star matching and distance two labelling