期刊名称：International Journal of Advances in Soft Computing and Its Applications
印刷版ISSN：2074-8523
出版年度：2016
卷号：8
期号：2
出版社：International Center for Scientific Research and Studies
摘要：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 GH of self-centered or non-self-centered u.e.p graph G with any other graph H and obtain its domination number.
