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

DOI10.2478/AWUTM-2019-0018MaRDI QIDQ2678680zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 24 January 2023

Published in Annals of West University of Timisoara - Mathematics and Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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)

Recommendations

• scientific article; zbMATH DE number 7295442
• \(L(3,2,1)\)-labeling of graphs
• \(L(3,2,1)\)-labelling of graphs
• A characterization of L(2, 1)-labeling number for trees with maximum degree 3
• The \(L (3, 2, 1)\)-labeling problem on graphs

Cites work

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

Cited in

(2)

• One point union of paths of cycles and their \(k\)-numbers
• \(\lambda\)-number of banana trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2678680)