World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Cyclic property of iterative eccentrication of a graph

    https://doi.org/10.1142/S1793830922501555Cited by:0 (Source: Crossref)

    The eccentric graph of a graph GG, denoted by GeGe, is a derived graph with the vertex set same as that of GG and two vertices in GeGe are adjacent if one of them is an eccentric vertex of the other. The process of constructing iterative eccentric graphs, denoted by GekGek is called eccentrication. A graph GG is said to be cyclic(t,l) if G,Ge,Ge2,,Gek,Gek+1,,Gek+l are the only non-isomorphic graphs, and the graph Gek+l+1 is isomorphic to Gek. In this paper, we prove the existence of an -cycle for any simple graph. The importance of this result lies in the fact that the enumeration of eccentrication of a graph reduces to a finite problem. Furthermore, the enumeration of a corresponding sequence of graph parameters such as chromatic number, domination number, independence number, minimum and maximum degree, etc., reduces to a finite problem.

    Communicated by Xueliang Li

    AMSC: 05C12, 05C75
    Remember to check out the Most Cited Articles!

    Be inspired by these NEW Mathematics books for inspirations & latest information in your research area!