Cyclic Edge Extensions Self-centered Graphs


Authors

Medha Itagi Huilgol - Department of Mathematics, Bangalore University, Central College Campus, Bangalore, Karnataka, India. Chitra Ramprakash - Department of Mathematics Bangalore University, Central College Campus, Bangalore, Karnataka, India.


Abstract

The eccentricity e(u) of a vertex u is the maximum distance of u to any other vertex of G. The maximum and the minimum eccentricity among the vertices of a graph G are known as the diameter and the radius of G respectively. If they are equal then the graph is said to be a self - centered graph. Edge addition /extension to a graph either retains or changes the parameter of a graph, under consideration. In this paper mainly, we consider edge extension for cycles, with respect to the self-centeredness(of cycles),that is, after an edge set is added to a self centered graph the resultant graph is also a self-centered graph. Also, we have other structural results for graphs with edge -extensions.


Share and Cite

  • Share on Facebook
  • Share on Twitter
  • Share on LinkedIn
ISRP Style

Medha Itagi Huilgol, Chitra Ramprakash, Cyclic Edge Extensions Self-centered Graphs, Journal of Mathematics and Computer Science, 10 (2014), no. 2, 131-137

AMA Style

Huilgol Medha Itagi, Ramprakash Chitra, Cyclic Edge Extensions Self-centered Graphs. J Math Comput SCI-JM. (2014); 10(2):131-137

Chicago/Turabian Style

Huilgol, Medha Itagi, Ramprakash, Chitra. "Cyclic Edge Extensions Self-centered Graphs." Journal of Mathematics and Computer Science, 10, no. 2 (2014): 131-137


Keywords


MSC


References