Distance-related Properties of Corona of Certain Graphs

Sriram, S. and Nagar, Atulya K. and Subramanian, K.G. (2016) Distance-related Properties of Corona of Certain Graphs. International Journal of Advances in Soft Computing and its Application, 8 (2). ISSN 2074-8523 (Accepted for Publication)

CORONA.pdf - Accepted Version

Download (474kB) | Preview


A graph G is called a m−eccentric point graph if each point of G has exactly m ≥ 1 eccentric points. When m = 1, G is called a unique eccentric point (u.e.p) graph. Using the notion of corona of graphs, we show that there exists a m−eccentric point graph for every m ≥ 1. Also, the eccentric graph Ge of a graph G is a graph with the same points as those of G and in which two points u and v are adjacent if and only if either u is an eccentric point of v or v is an eccentric point of u in G. We obtain the structure of the eccentric graph of corona G ◦ H of self-centered or non-self-centered u.e.p graph G with any other graph H and obtain its domination number.

Item Type: Article
Additional Information and Comments: The article has been published - Publisher's URL is: http://www.home.ijasca.com/article-in-press/volume-8-2016/vol-8-2/
Keywords: Domination, Eccentricity, Eccentric Graph
Faculty / Department: Faculty of Science > Mathematics and Computer Science
Depositing User: Atulya Nagar
Date Deposited: 20 Sep 2016 13:29
Last Modified: 14 Dec 2016 16:05
URI: https://hira.hope.ac.uk/id/eprint/1538

Actions (login required)

View Item View Item