On some bounds and exact formulae for connective eccentric indices of graphs under some graph operations (Q2019272)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6420275
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On some bounds and exact formulae for connective eccentric indices of graphs under some graph operations |
scientific article; zbMATH DE number 6420275 |
Statements
On some bounds and exact formulae for connective eccentric indices of graphs under some graph operations (English)
0 references
27 March 2015
0 references
Summary: 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.
0 references
joins of graphs
0 references
symmetric difference of graphs
0 references
disjunction of graphs
0 references
splice of graphs
0 references
0.9412684
0 references
0.9255903
0 references
0.9251769
0 references
0.91906184
0 references
0.9175441
0 references
0.9172002
0 references
0.9147113
0 references
0.9144807
0 references
0.9133738
0 references
