We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
The week's pick
Responsive image
An Efficient Restoration Method for the Faint Dot Matrix Images

Ao Zhu Peng Cao
Random Articles
Reseach Article

Graph Characterization based on DRI Values and Degree of Graph

by Shreedevi V. Shindhe
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 65 - Number 3
Year of Publication: 2013
Authors: Shreedevi V. Shindhe
10.5120/10903-5830

Shreedevi V. Shindhe . Graph Characterization based on DRI Values and Degree of Graph. International Journal of Computer Applications. 65, 3 ( March 2013), 11-14. DOI=10.5120/10903-5830

@article{ 10.5120/10903-5830,
author = { Shreedevi V. Shindhe },
title = { Graph Characterization based on DRI Values and Degree of Graph },
journal = { International Journal of Computer Applications },
issue_date = { March 2013 },
volume = { 65 },
number = { 3 },
month = { March },
year = { 2013 },
issn = { 0975-8887 },
pages = { 11-14 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume65/number3/10903-5830/ },
doi = { 10.5120/10903-5830 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:17:41.063296+05:30
%A Shreedevi V. Shindhe
%T Graph Characterization based on DRI Values and Degree of Graph
%J International Journal of Computer Applications
%@ 0975-8887
%V 65
%N 3
%P 11-14
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper we are characterizing the different types of graphs based on the value of DRI of each vertex and degree of graph. Here the degree of graph means the maximum degree. The DRI of each vertex has some specific properties for some basic class of graphs. For example if graph is of degree 2 and the DRI sequence DRI(1,0,…,01) then the graph is a path. Using these observations we can determine the class of graph. Some classes that are covered in this paper are complete graphs, paths, cycles, star graphs, self centered and almost self centered graphs.

References
  1. Distance in graphs - Fred Buckley, Frank Harary, Addison-Wesley Pub. Co. , ©1990 .
  2. Harary. F, Graph Theory, Addison Wesley.
  3. Anany Levitin, Introduction to the design and analysis of Algorithms, 2nd Ed, 2008.
  4. H. B. Walikar, Shreedevi V. Shindhe- Diametral Reachable Index (DRI) of a vertex, International Journal of Computer Applications (43-47) Volume 49– No. 16, July 2012.
  5. Shreedevi V. Shindhe, Ph. D thesis, "Algorithmic aspects of distance based parameters", Karnatak University, Dharwad, 2012.
  6. H. B. Walikar, Shreedevi V. Shindhe , Ishwar Baidari - DRI of a vertex, Self Centered Graphs and Almost Self Centered Graphs - An algorithmic approach,(152-156) International Journal of Computer Applications, Issue. 2, Vol. 4 August 2012.
  7. Sandi KLAVZAR, Kishori P. NARAYANKAR and H. B. WALIKAR -Almost Self-Centered Graphs, Acta Mathematica Sinica, English Series, Dec. , 2011, Vol. 27, No. 12, pp. 2343–2350.
  8. Coremen. T. H, Leiserson, C. E. Rivest R. L, and C Stein, Introduction to Algorithms, 2nd Ed. MIT press, Cambridge, MA, 2001.
  9. Data Structures, Algorithms, and Applications in C++, Sartaj Sahni. McGraw-Hill Education, 1998.
Index Terms

Computer Science
Information Sciences

Keywords

DRI diametral paths diametral reachable index diametral vertex

Powered by PhDFocusTM