Cyclic Edge Extensions Selfcentered Graphs

1545
Downloads

1906
Views
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 selfcenteredness(of cycles),that is, after an edge set is added to a self centered graph the resultant graph is also a selfcentered graph. Also, we have other structural results for graphs with edge extensions.
Share and Cite
ISRP Style
Medha Itagi Huilgol, Chitra Ramprakash, Cyclic Edge Extensions Selfcentered Graphs, Journal of Mathematics and Computer Science, 10 (2014), no. 2, 131137
AMA Style
Huilgol Medha Itagi, Ramprakash Chitra, Cyclic Edge Extensions Selfcentered Graphs. J Math Comput SCIJM. (2014); 10(2):131137
Chicago/Turabian Style
Huilgol, Medha Itagi, Ramprakash, Chitra. "Cyclic Edge Extensions Selfcentered Graphs." Journal of Mathematics and Computer Science, 10, no. 2 (2014): 131137
Keywords
 Self centered graphs
 Edge extension graphs
 reduced radius
 reduced diameter of cycles
 Iterations of cycles and paths.
MSC
References

[1]
Akira Saito, Cycles of length 2 modulo 3 in graphs, Discrete Mathematics, 101 (1992), 285289.

[2]
Akira Saito, Gantao Chen, Graphs with a cycle of length divisible by three, Journal of Combinatorial theory, 60 (1994), 277292.

[3]
Akira Saito, Linda Lesniak, Nathaniel Dean, Cycles of length 0 modulo 4 in graphs, Discrete Mathematics, 121 (1993), 3749.

[4]
Akram B. Attar, Edge Extension of Graphs and Digraphs, The Journal of Mathematics and Computer Science, 3 (2011), 110.

[5]
Akram B. Attar, Extensibility of Graphs, Journal of Applied Mathematics, Islamic Azad University of Lahijan, 6 (2009), 19.

[6]
F. Buckley, Selfcentered graphs with a given radius, Congressus Numerantium, 23 (1979), 211 215.

[7]
F. Buckley, F. Harary, Distance in Graphs, Addison Wesley, (1990)

[8]
Ronald D. Dutton, Sirisha R. Medidi, Robert C.Brigham, Changing and Unchanging radius of the graph, Linear Algebra and its Applications, 217 (1995), 6782.

[9]
T. N. Janakiraman, M. Bhanumathi, S. Muthammai, Self  centered super graph of a graph and center number of a graph, Ars Combinatorica, 87 (2008), 271290.

[10]
H. B. Walikar, F. Buckley, M. K. Itagi, Radius  edge  invariant and diameter  edge invariant graphs, Discrete Mathematics, 272(1) (2001), 119126.

[11]
H. B. Walikar, F. Buckley, M. K. Itagi, Diameter essential edges in a graph, Discrete Mathematics, 259 (2002), 211225.

[12]
H. B. Walikar, F. Buckley, M. K. Itagi, Radius essential edges in a graph, Journal of Combinatorial Mathematics and Combinatorial Computing, 53 (2005), 209220.

[13]
H. B. Walikar, F. Buckley, Medha Itagi Huilgol , Diameter vital edges in a graph, Aeqationes Mathematicae, 82 (2011), 201211.

[14]
R. C. Brigham, R. D. Dutton, An Extremal Problem for Edge Domination Insensitive Graphs, Discrete Appl. Math , 20 (1988), 113125.

[15]
R. C. Brigham, R. D. Dutton, Changing and Unchanging Invariants: The Edge Clique Cover Number, Congr. Numer, 70 (1990), 145152.

[16]
F. Harary, Changing and Unchanging Invariants for Graphs, Bull. Malaysian Math. Soc, 5 (1982), 7378.

[17]
L. M. Lawson, T. W. Haynes, Changing and Unchanging of the Node Covering Number of a Graph, Congr. Numer, 77 (1991), 157162.

[18]
S. Medidi, The Effect of Node Deletions, Edge Additions and Edge Deletions on Graphs: Node Connectivity, Edge Connectivity, Diameter, and Radius, Masters Project, Dept. of Computer Science, Univ. of Central Florida (1992)