BibTex Citation Data :
@article{JM12250, author = {Ambar Puspasari and Bambang Irawanto}, title = {BILANGAN RADIO PADA GRAF GEAR}, journal = {MATEMATIKA}, volume = {16}, number = {1}, year = {2016}, keywords = {}, abstract = { Let d(u,v) denote the distance between two distinct vertices of connected graph G, and diam (G) be the diameter of G. A radio labeling c of G is an assignment of positive integer to the vertices of G satisfying d ( u, v ) + | c ( u ) − c ( v )| ≥ diam( G ) + 1.The maximum integer in the range of the labeling is its span. The radio number of G, rn ( G ), is the minimum possible span. Radio number of gear graph G’ n , for n ≥ 4 is rn ( G’ n ) ≥ 4 n + 2, and n ≥ 7 is rn ( G’ n ) ≤ 4 n + 2. The labeling of gear graph G’ n , n=4,5,6 is rn ( G’ 4 ) = 18, rn ( G’ 5 ) = 22, rn ( G’ 6 ) = 26 than for n ≥ 4 , the radio number rn ( G’ n ) is 4 n + 2. }, url = {https://ejournal.undip.ac.id/index.php/matematika/article/view/12250} }
Refworks Citation Data :
Let d(u,v) denote the distance between two distinct vertices of connected graph G, and diam (G) be the diameter of G. A radio labeling c of G is an assignment of positive integer to the vertices of G satisfying d(u, v) + |c(u) − c(v)| ≥ diam(G) + 1.The maximum integer in the range of the labeling is its span. The radio number of G, rn(G), is the minimum possible span. Radio number of gear graph G’n , for n ≥ 4 is rn(G’n) ≥ 4n + 2, and n ≥ 7 is rn(G’n) ≤ 4n + 2. The labeling of gear graph G’n , n=4,5,6 is rn(G’4) = 18, rn(G’5) = 22, rn(G’6) = 26 than
for n ≥ 4 , the radio number rn(G’n) is 4n + 2.
Last update:
Last update: 2024-11-07 05:31:46