Open AccessOn Some Bounds and Exact Formulae for Connective Eccentric Indices of Graphs under Some Graph Operations
Author(s) -
Nilanjan De,
Anita Pal,
Sk. Md. Abu Nayeem
Publication year - 2014
Publication title -
international journal of combinatorics
Language(s) - English
Resource type - Journals
eISSN - 1687-9171
pISSN - 1687-9163
DOI - 10.1155/2014/579257
Subject(s) - mathematics , combinatorics , topological index , graph , joins , discrete mathematics , computer science , programming language
The connective eccentric index of a graph is a topological index involving degrees and eccentricities of vertices of the graph. In this paper, we have studied the connective eccentric index for double graph and double cover. Also we give the connective eccentric index for some graph operations such as joins, symmetric difference, disjunction, and splice of graphs.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom