BibTex Citation Data :
@article{JM7167, author = {Meivita Nur Arifiani and R. Heru Tjahyana}, title = {BILANGAN RADIO PADA GRAF SIKEL DENGAN DAN GRAF SIKEL TENGAH}, journal = {Jurnal Matematika}, volume = {3}, number = {1}, year = {2014}, keywords = {radio labeling, cycle with chords, middle graph of cycle , diameter, radio number.}, abstract = { ABSTRACT. Let be a simple connected graph and denote the distance between any two vertices in . The maximum distance between any pair of vertices is called the diameter denoted by . A radio labeling for is an injectif function such that for any vertices dan it is satisfied that . The span of an radio labeling is max . The minimum span of a radio labeling of is called radio number denoted by . In this T hesis we study radio number of cycle with and graph of cycle . }, url = {https://ejournal3.undip.ac.id/index.php/matematika/article/view/7167} }
Refworks Citation Data :
ABSTRACT.Let be a simple connected graph and denote the distance between any two vertices in . The maximum distance between any pair of vertices is called the diameter denoted by . A radio labeling for is an injectif function such that for any vertices dan it is satisfied that . The span of an radio labeling is max . The minimum span of a radio labeling of is called radio number denoted by . In this Thesis we study radio number of cycle with and graph of cycle .
Last update:
