Radio labeling of biconvex split graphs

DOI10.1080/09728600.2024.2381712MaRDI QIDQ6995190zbMATH OpenFDO

Authors

Publication date 22 April 2025

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1080/09728600.2024.2381712

Mathematics Subject Classification ID

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

Cites work

• A lower bound technique for radio k-coloring
• A structure theorem for the consecutive 1's property
• A survey on radio \(k\)-colorings of graphs
• Biconvex graphs: Ordering and algorithms
• Efficient parallel algorithms for doubly convex-bipartite graphs
• scientific article; zbMATH DE number 5850548 (Why is no real title available?)
• scientific article; zbMATH DE number 2154968 (Why is no real title available?)
• scientific article; zbMATH DE number 2170463 (Why is no real title available?)
• Labelling Graphs with a Condition at Distance 2
• Maximum matching in a convex bipartite graph
• Multilevel Distance Labelings for Paths and Cycles
• Optimal radio labellings of block graphs and line graphs of trees
• Radio labelings of graphs
• Radio number for trees
• The radio antipodal and radio numbers of the hypercube.

Cited in

(1)

• Radio number of zero divisor graphs induced by product of three primes

This page was built for publication: Radio labeling of biconvex split graphs

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