\(L(p,q)\)-labeling of digraphs

DOI10.1016/J.DAM.2008.12.007zbMath1173.05039OpenAlexW2091880674MaRDI QIDQ1026134

J. Blot

Publication date: 24 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.12.007

zbMATH Keywords

treecycledigraphpath\(L(p,q)\)-labeling

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

\(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles ⋮ Exact square coloring of graphs resulting from some graph operations and products ⋮ \(L(2,1)\)-labeling of oriented planar graphs

Cites Work

• Distance-two labelings of digraphs
• On \(L(d,1)\)-labelings of graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: \(L(p,q)\)-labeling of digraphs