On radio connection number of graphs

DOI10.7151/dmgt.2196zbMath1411.05094OpenAlexW2910464154MaRDI QIDQ2416954

Ruxandra Marinescu-Ghemeci

Publication date: 27 May 2019

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

Full work available at URL: https://doi.org/10.7151/dmgt.2196

zbMATH Keywords

\(L(2,1)\)-labelingradio coloring\(L(2,1)\)-connection number\(L(2,1)\)-connectivityradio connection number

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Proper connection of graphs
• On (strong) proper vertex-connection of graphs
• A linear time algorithm for \(L(2,1)\)-labeling of trees
• Rainbow connection in graphs
• Labelling Graphs with a Condition at Distance 2
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• Chromatic Graph Theory
• Multilevel Distance Labelings for Paths and Cycles

This page was built for publication: On radio connection number of graphs