On Corona of Certain Graphs

Sriram, S. and Nagar, Atulya K. and Subramanian, K.G. (2015) On Corona of Certain Graphs. In: International Workshop on Graph Algorithms (IWGA2015), 13 May 2015, Penang, Malaysia.

Full text not available from this repository. (Request a copy)


A graph G is called a m−eccentric point graph if each point of G has exactly m 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 characterize the eccentric graph of corona G ◦ H of self-centered u.e.p graph G with any other graph H and obtain its domination number.

Item Type: Conference or Workshop Item (Paper)
Additional Information and Comments: Full text available in the conference proceedings: http://event.cs.usm.my/IWGA2015/images/Proceedings-IWGA2015.pdf
Keywords: Domination, Eccentricity, Eccentric Graph
Faculty / Department: Faculty of Science > Mathematics and Computer Science
Depositing User: Atulya Nagar
Date Deposited: 09 Jun 2016 11:47
Last Modified: 29 Nov 2016 12:21
URI: https://hira.hope.ac.uk/id/eprint/1449

Actions (login required)

View Item View Item