NotesWhat is notes.io?

Notes brand slogan

Notes - notes.io

medskip

%printbibliography
begin{thebibliography}{99}
bibitem{P-Baldi-1990}
P.Baldi, E.C.Posner, Graph Coloring Bounds for Cellular Radio, textit{Computers Math. Applic.},
vol. 19, (1990), pp. 91-97.
bibitem{G-Chartrand-2002}
G.Chartrand, D.Erwin, P.Zhang, Radio antipodal colorings of graphs,
textit{Mathematica Bohemica},
vol. 127, (2002), pp. 57-69.
bibitem{R-Kalfakakou-2003}
R.Kalfakakou, G.Nikolakopoulou, E.Savvidou, M.Tsouros, Graph RadioColoring Concpets,
textit{Yugoslav Journal of Operations Research},
vol. 13, (2003), pp. 207-215.
bibitem{D-D-Liu-2002}
D.D.Liu, X.Zhu, Multilevel Labelings for Paths and Cycles,
textit{SIDMA 2005}.
bibitem{M-Kchikech-2005}
M.Kchikech, R.Khennoufa, O.Togni, Radio k-Labelings for Cartesian Products of Graphs,
textit{LE2I, UMR CNRS 5158}.
bibitem{D-D-Liu-2006}
D.D.Liu, Radio Number for Trees, (2006).
bibitem{M-Kchikech-2007}
M.Kchikech, R.Khennoufa, O.Togni, Linear and cyclic radio k-labeling of Trees,
textit{LE2I, UMR CNRS 5158}.
bibitem{C-Fernandez-2008}
C.Fernandez, A.Flores, M.Tomova, C.Wyels, The Radio Number of Gear Graphs,
textit{2000 AMS Subject Classification: 05C78 (05C15)}.
bibitem{R-Khennoufa-2008}
R.Khennoufa, O.Togni, Multilevel BAndwidth and Radio Labelings of Graphs,
textit{LE2I, UMR CNRS 5158}
bibitem{P-Panigrahi-2009}
P.Panigrahi, A Survey on Radio k-Colorings of Graphs,
textit{AKCE J. Graphs. Combin.},
vol. 6, (2009), pp. 161-169.
bibitem{D-D-Liu-2009}
D.D.Liu, M.Xie, Radio Number for Square Paths, (2009).
bibitem{S-R-Kola-2010}
S.R.Kola, P.Panigrahi, An Improved Lower Bound for the Radio k-chromatic n Number of the Hypercube $Q_{n}$,
textit{Computers and Mathematics with Applications},
vol. 60, (2010), pp. 2131-2140.
bibitem{A-Gottshall-2010}
A.Gottshall, J.Kahn, The Radio Number of Biregular Paths,
textit{A Major Qualifying Project Report Submitted to The Faculty of the Worcester Polytechnic Institute},
(2010).
bibitem{A-Vladoi-2010}
A.Vladoi, Wireless Networks: A Labeling Problem,
textit{A Senior Report Submitted to The Division of Science, Mathematics and Computing of Bard College},
(2010).
bibitem{C-Wyels-2010}
C.Wyels, M.Tomova, Radio Labeling Cartesian Graph Products,
(2010)
bibitem{B-Sooryanarayana-2010}
B.Sooryanarayana, V.Kumar, Manjula K., Radio Number of Cube of a Path,
textit{International J.Math. Combin,},
vol. 1, (2010), pp. 05-29.
bibitem{L-Saha-2011}
L.Saha, P.Panigrahi, P.Kumar, Improved Bounds for Radio k-Chromatic Number of Hypercube $Q_{n}$,
textit{International Journal of Mathematics and Mathematical Sciences},
vol. 2011, (2011), article ID 961649.
bibitem{K-Benson-2011}
K.Benson, M.Porter, M.Tomova, The Radio Number of All Graphs of Order n and Diameter n-2,
textit{}
2000 AMS Subject Classification: 05C78 (05C15, 05C38), (2011).
bibitem{H-Wang-2011}
H.Wang, X.Xu, Y.Yang, B.Zhang, M.Luo, G.Wang, Radio Number of Ladder Graphs,
textit{International Journal of Computer Mathematics},
88:10, (2011), pp. 2026-2034, DOI: 10.1080/00207160.2010.539211
bibitem{A-A-Bhatti-2011}
A.A.Bhatti, A.Nisar, M.Kanwal, Radio Number of Wheel Like Graphs,
textit{International journal on applications of graph theory in wireless ad hoc networks and sensor networks}.
vol. 3, (2011).
bibitem{P-Martinez-2011}
P.Martinez, J.Ortiz, M.Tomova, C.Wyels, Radio Numbers for Generalized Prism Graphs,
textit{Discussiones Mathematicae Graph Theory xx (xxxx) xxx–xxx},
(2011).
bibitem{P-V-S-Reddy-2011}
P.V.S.Reddy, K.V.Iyer, Upper Bounds on the Radio Number of Some Trees,
textit{International Journal of Pure and Applied Mathematics},
vol. 71, (2011), pp. 207-215.
bibitem{M-T-Rahim-2012-gear}
M.T.Rahim, M.Farooq, M.Ali, S.Jan, Multi-level distance labelings for generalized gear graphs,
textit{Internatioal Journal of Mathematics and Soft Computing},
vol. 2, (2012), pp 57-63.
bibitem{M-T-Rahim-2012-helm}
M.T.Rahim, I.Tomescu, Multi-level distance labeling for helm graphs,
(2012).
bibitem{K-N-Meera-2012}
K.N.Meera, B.Sooryanarayana, Radiatic dimension of a Graph,
textit{Journal of Computations and Modelling},
vol. 2, (2012), pp. 109-131.
bibitem{R-Cada-2013}
R.Cada, J.Ekstein, P.Holub, O.Togni, Radio Labeling of Distance Graphs,
(2013).
bibitem{C-R-Kenneth-2013}
C.R.Kenneth, A.William, R.C.Thivyarathi, Radio Antipodal Number of Circulant Graphs,
textit{International Journal of Engineering Research and Technology},
vol. 2, (2013).
bibitem{N-S-Rao-2013}
N.S.Rao, K.S.Rao, K.Mahalakshmi, Radio Labeling of a Class of Planar Graphs,
textit{International Journal of Innovative Research in Science, Engineering and Technology},
vol. 2, (2013), ISSN: 2319-8753.
bibitem{S-K-Vaidya-2013}
S.K.Vaidya, D.D.Bantva, Radio Number of Total Graph of Paths,
textit{ISRN Combinatorics},
vol. 2013, (2013), article id 326038.
bibitem{K-F-Benson-2013}
K.F,Benson-2013, On Radio Labeling of Diameter N-2 and Caterpillar Graphs,
textit{PhD diss., University of Iowa},
(2013).
bibitem{T-S-A-Jiang-2014}
T-Shun A.Jiang, The Radio Number of Grid Graphs,
(2014).

end{thebibliography}
     
 
what is notes.io
 

Notes.io is a web-based application for taking notes. You can take your notes and share with others people. If you like taking long notes, notes.io is designed for you. To date, over 8,000,000,000 notes created and continuing...

With notes.io;

  • * You can take a note from anywhere and any device with internet connection.
  • * You can share the notes in social platforms (YouTube, Facebook, Twitter, instagram etc.).
  • * You can quickly share your contents without website, blog and e-mail.
  • * You don't need to create any Account to share a note. As you wish you can use quick, easy and best shortened notes with sms, websites, e-mail, or messaging services (WhatsApp, iMessage, Telegram, Signal).
  • * Notes.io has fabulous infrastructure design for a short link and allows you to share the note as an easy and understandable link.

Fast: Notes.io is built for speed and performance. You can take a notes quickly and browse your archive.

Easy: Notes.io doesn’t require installation. Just write and share note!

Short: Notes.io’s url just 8 character. You’ll get shorten link of your note when you want to share. (Ex: notes.io/q )

Free: Notes.io works for 12 years and has been free since the day it was started.


You immediately create your first note and start sharing with the ones you wish. If you want to contact us, you can use the following communication channels;


Email: [email protected]

Twitter: http://twitter.com/notesio

Instagram: http://instagram.com/notes.io

Facebook: http://facebook.com/notesio



Regards;
Notes.io Team

     
 
Shortened Note Link
 
 
Looding Image
 
     
 
Long File
 
 

For written notes was greater than 18KB Unable to shorten.

To be smaller than 18KB, please organize your notes, or sign in.