The \(L(2,1)\)-labeling of unigraphs

DOI10.1016/j.dam.2011.04.015zbMath1223.05258MaRDI QIDQ2275923

Rossella Petreschi, Tiziana Calamoneri

Publication date: 10 August 2011

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

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

zbMATH Keywords

frequency assignment; \(L(2,1)\)-labeling; unigraphs

Mathematics Subject Classification ID

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

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

On \(L(k, k - 1, \ldots, 1)\) labeling of triangular lattice, \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs, Optimal \(L(3, 2, 1)\)-labeling of triangular lattice

Cites Work

• Unnamed Item
• Unnamed Item
• \(\lambda\)-coloring matrogenic graphs
• Labeling bipartite permutation graphs with a condition at distance two
• Simple separable graphs
• Graphic sequences with unique realization
• Decomposition of graphical sequences and unigraphs
• \(L(h,1)\)-labeling subclasses of planar graphs
• Threshold graphs and related topics
• Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)
• Labelling Graphs with a Condition at Distance 2
• Labeling Chordal Graphs: Distance Two Condition
• The $L(2,1)$-Labeling Problem on Graphs
• On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs