A.P. Santhakumaran

DOI Number
First page
Last page


Let $G$ be a connected graph and $\zeta$ the set of all cliques in $G$. In this paper we introduce the concepts of unique $(\zeta, \zeta)$-eccentric clique graphs and self $(\zeta, \zeta)$-centered graphs. Certain standard classes of graphs are shown to be self $(\zeta, \zeta)$-centered, and we characterize unique $(\zeta, \zeta)$-eccentric clique graphs which are self $(\zeta, \zeta)$-centered.


clique graph, graph eccentricity, connected graph.

Full Text:



L. C. Freeman: A set of measures f centrality based on be-tween-ness, Sociometry 40 (1977), 35-41.

L. C. Freeman: Centrality in Social networks: 1. Conceptual clarification, Social Networks, 1 (3) (1978 – 79), 215-239.

F. Harary: Graph Theory, Addison-Wesley Reading MA (1969).

K. R. Parthasarathy and R. Nandakumar: Unique eccentric point graphs, Discrete Mathematics 46 (1983), 69-74.

A. P. Santhakumaran and S. Arumugam: Centrality with respect to cliques, International Journal of Management and Systems Vol. 18 No. 3 (2002), 275-280.

A. P. Santhakumaran: Unique vertex-to-clique eccentric clique graphs, Bulletin of Pure and Applied Sciences Vol. 24E No. 1 (2005), 167-172.

A. P. Santhakumaran: Periphery with respect ot clique in graphs, Journal of Discrete Mathematical sciences and Cryptography, 2 (2007), 245-254.

A. P. Santhakumaran and S. Arumugam: Radius and diameter with respect to cliques in graphs, Journal of Combinatorial Mathematics and Combinatorial Computing 72 (2010), 231-241.

P. J. Slater: Centrality of paths and vertices in a graph: Cores and Pits, Theory and applications of graphs, Ed. G. Chartrand, John Wiley (1981) 529-542.

P. J. Slater: Some definitions of Central Structures, In: Koh, K.M., Yap, H.P. (eds) Graph Theory Singapore 1983. Lecture Notes in Mathematics, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0073115.

DOI: https://doi.org/10.22190/FUMI201217016S


  • There are currently no refbacks.

© University of Niš | Created on November, 2013
ISSN 0352-9665 (Print)
ISSN 2406-047X (Online)