A lower bound on the eccentric connectivity index of a graph (Q765366): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2011.09.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2035675880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4903398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The eccentric connectivity index of nanotubes and nanotori / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4913984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5450337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the eccentric connectivity index of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the eccentric distance sum of trees and unicyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On eccentric connectivity index / rank
 
Normal rank

Latest revision as of 00:50, 5 July 2024

scientific article
Language Label Description Also known as
English
A lower bound on the eccentric connectivity index of a graph
scientific article

    Statements

    A lower bound on the eccentric connectivity index of a graph (English)
    0 references
    0 references
    0 references
    0 references
    19 March 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    eccentricity
    0 references
    eccentric connectivity index
    0 references
    diameter
    0 references
    0 references