On \(L(2 , 1)\)-labelings of oriented graphs

DOI10.7151/DMGT.2240zbMath1479.05317arXiv1902.05467OpenAlexW2913030890MaRDI QIDQ2062670

Lucas Colucci, Ervin Gyoeri

Publication date: 3 January 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.05467

zbMATH Keywords

directed graphs\(L(2, 1)\)-labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• \(L(2,1)\)-labeling of oriented planar graphs
• Path covering number and \(L(2,1)\)-labeling number of graphs
• A survey on labeling graphs with a condition at distance two
• On the geodetic number of a graph
• Labelling Graphs with a Condition at Distance 2

This page was built for publication: On \(L(2 , 1)\)-labelings of oriented graphs