CFP last date
21 July 2025
Call for Paper
August Edition
IJCA solicits high quality original research papers for the upcoming August edition of the journal. The last date of research paper submission is 21 July 2025

Submit your paper
Know more
The week's pick
Responsive image
FORENSIC ANALYSIS FRAMEWORKS FOR ENCRYPTED CLOUD STORAGE INVESTIGATIONS

Joy Awoleye Sarah Mavire Allan Munyira Kelvin Magora
Random Articles
Reseach Article

Algorithmic Approach to Eccentricities, Diameters and Radii of Graphs using DFS

by Ishwar Baidari, Ravi Roogi, Shridevi Shinde
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 54 - Number 18
Year of Publication: 2012
Authors: Ishwar Baidari, Ravi Roogi, Shridevi Shinde
10.5120/8664-2284

Ishwar Baidari, Ravi Roogi, Shridevi Shinde . Algorithmic Approach to Eccentricities, Diameters and Radii of Graphs using DFS. International Journal of Computer Applications. 54, 18 ( September 2012), 1-4. DOI=10.5120/8664-2284

@article{ 10.5120/8664-2284,
author = { Ishwar Baidari, Ravi Roogi, Shridevi Shinde },
title = { Algorithmic Approach to Eccentricities, Diameters and Radii of Graphs using DFS },
journal = { International Journal of Computer Applications },
issue_date = { September 2012 },
volume = { 54 },
number = { 18 },
month = { September },
year = { 2012 },
issn = { 0975-8887 },
pages = { 1-4 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume54/number18/8664-2284/ },
doi = { 10.5120/8664-2284 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:55:59.723031+05:30
%A Ishwar Baidari
%A Ravi Roogi
%A Shridevi Shinde
%T Algorithmic Approach to Eccentricities, Diameters and Radii of Graphs using DFS
%J International Journal of Computer Applications
%@ 0975-8887
%V 54
%N 18
%P 1-4
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Let G = (V, E) be a graph. The distance d (u, v) between two nodes u and v is the length of the shortest path between them. The eccentricity E (v) of a graph vertex v in connected graph G is the maximum distance between v and any other vertex u of G. i. e. maxu V{ d (u, v) }. The diameter of the graph is a graph the longest shortest path between any two graph vertices (u ,v) of a graph i. e. Diam (G) = max { E (v)/ v V}. The minimum eccentricity of a graph is radius i. e. Rad (G) = min { E (v)/ v V}. In this paper we propose algorithms for finding eccentricity diameter and radius of a tree using DFS.

References
  1. A note on Eccentricities, diameters, and radii Bang Ye Wu Kun–Mao Chao
  2. Alan Gibbons, Algorithmic Graph Theory. Cambridge University Press. 1999
  3. Lich – Hsing Hsu and Cheng- kuan Lin Graph Theory and Interconnection Networks. CRC Press 2009.
  4. . Alfred V Aho, John E, Hopcroft and Jeffrey D. Ullman Data structures and Algorithms. Pearson Education 2006.
  5. Thomas H Cormen Charles E Leiserson and Ronald L, Rivest. Algorithms PHI 2001.
  6. Geir Agnarsson, Raymond Greenlaw. Graph Theory Modeling Applications and Algorithms.
  7. Dieter Jungnickel Graphs Networks and Algorithms Springer 2006.
  8. E COCKAYNE and S. GODDMAN and . HEDETINIEMI. A Liner Algorithm for the Domination Number of a Tree
  9. B. S. Panda and D. Pradhan. Locally Connected Spanning Trees in Cographs, Complements of Bipartite Graph and Doubly Chordal Graph.
  10. Gary chartarand, Ortrud R Oellermann, Applied and Algorithmic Graph Theory Mc Graw-Hill Inc 1993
Index Terms

Computer Science
Information Sciences

Keywords

Eccentricity Radius Distance Diameter and Graph

Powered by PhDFocusTM