Radio number for total graph of paths

DOI10.1155/2013/326038zbMath1264.05045OpenAlexW1970855344WikidataQ58994161 ScholiaQ58994161MaRDI QIDQ1952708

Samir Vaidya, Devsi Bantva

Publication date: 3 June 2013

Published in: ISRN Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/326038

zbMATH Keywords

pathsdistancediameterradio networktotal graphradio labeling

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (6)

Further results on the radio number of trees ⋮ Radio number for middle graph of paths ⋮ Radio number of trees ⋮ Radio number of trees ⋮ Optimal radio labellings of block graphs and line graphs of trees ⋮ Omega index of line and total graphs

Cites Work

• \(T\)-colorings of graphs: recent results and open problems
• Radio number for trees
• A survey on labeling graphs with a condition at distance two
• E ₁₁ and M theory
• Labelling Graphs with a Condition at Distance 2
• Labeling Chordal Graphs: Distance Two Condition
• The $L(2,1)$-Labeling Problem on Graphs
• Multilevel Distance Labelings for Paths and Cycles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Radio number for total graph of paths