IJPAM: Volume 120, No. 1 (2018)
Title
UNIFORM NUMBERS OF CYCLIC GRAPHSAuthors
M. Elakkiya


Amrita Vishwa Vidyapeetham, INDIA
Abstract
The uniform number of a connected graph










History
Received: September 5, 2017
Revised: January 11, 2018
Published: August 13, 2018
AMS Classification, Key Words
AMS Subject Classification: 05C22
Key Words and Phrases: graphs, distances, detour distance, uniform number.
Download Section
Download paper from here.You will need Adobe Acrobat reader. For more information and free download of the reader, see the Adobe Acrobat website.
Bibliography
- 1
- Fred Buckley, Frank Harary, Distance in Graphs, Addison-Wesley Pub. Co., 1990.
- 2
- G. Chartrand, P. Zhang, Distance in graphs - taking the long view, AKCE J. Graphs Combin., 1 (2004) 1-13.
- 3
- M. Elakkiya, Kumar Abhishek, Uniform number of a graph, Submitted 2017.
- 4
- Joseph A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics, 18 (2015), #DS6.
- 5
- O. Ore, Hamiltonian connected graphs, J. Math Pures Appl., 42 (1963), 21-27.
- 6
- Brightwell Graham, Winkler Peter, Maximum hitting time for random walks on graphs, Random Structures & Algorithms, 1, No. 3 (1990), 263-276, doi: 10.1002/rsa.3240010303.
How to Cite?
DOI: 10.12732/ijpam.v120i1.6 How to cite this paper?Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2018
Volume: 120
Issue: 1
Pages: 67 - 75
Google Scholar; DOI (International DOI Foundation); WorldCAT.
This work is licensed under the Creative Commons Attribution International License (CC BY).