\(L(3, 2, 1)\)-labeling of banana trees

DOI10.2478/AWUTM-2019-0018OpenAlexW3115875306MaRDI QIDQ2678680

Yanyan Li

Publication date: 24 January 2023

Published in: Analele Universității de Vest din Timișoara. Seria Matematică-Informatică (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/awutm-2019-0018

zbMATH Keywords

channel assignment\(L(3, 2, 1)\)-labelingbanana tree\(k\)-number

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(L(3,2,1)\)-labeling of graphs
• \(T\)-colorings of graphs: recent results and open problems
• Operations of interlaced trees and graceful trees
• The cordiality of the path-union of \(n\) copies of a graph
• Labelling Graphs with a Condition at Distance 2

This page was built for publication: \(L(3, 2, 1)\)-labeling of banana trees