The eccentric connectivity polynomial of some graph operations
From MaRDI portal
Publication:3099883
zbMATH Open1284.05153MaRDI QIDQ3099883FDOQ3099883
Authors: A. R. Ashrafi, Modjtaba Ghorbani, M. A. Hosseinzadeh
Publication date: 22 November 2011
Full work available at URL: https://eudml.org/doc/196270
Recommendations
Cited In (12)
- Modified eccentric connectivity polynomial of some graph operations
- Computing vertex-based eccentric topological descriptors of zero-divisor graph associated with commutative rings
- Construction algorithm for zero divisor graphs of finite commutative rings and their vertex-based eccentric topological indices
- Title not available (Why is that?)
- Eccentric connectivity polynomial of some graph operations
- Title not available (Why is that?)
- Title not available (Why is that?)
- On some bounds and exact formulae for connective eccentric indices of graphs under some graph operations
- Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index
- On the minimal eccentric connectivity indices of bipartite graphs with some given parameters
- On the eccentric connectivity polynomial of \(\mathcal{F}\)-sum of connected graphs
- The \(k\)-distance neighborhood polynomial of some graph operations
This page was built for publication: The eccentric connectivity polynomial of some graph operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3099883)