A New Method for Computing the Eccentric Connectivity Index of Fullerenes

Ghorbani, Modjtaba; Malekjani, Khadijeh

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “A New Method for Computing the Eccentric Connectivity Index of Fullerenes”

Remarks on the Balaban Index

Ghorbani, Modjtaba (2013)

Serdica Journal of Computing

Similarity:

In this paper we compute some bounds of the Balaban index and then by means of group action we compute the Balaban index of vertex transitive graphs. ACM Computing Classification System (1998): G.2.2 , F.2.2.

On equality of edge-connectivity and minimum degree of a graph

Ján Plesník, Štefan Znám (1989)

Archivum Mathematicum

Similarity:

A new upper bound on the total domination number of a graph.

Henning, Michael A., Yeo, Anders (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Reconstruction of graphs with special degree-sequences

Jozef Širáň (1982)

Mathematica Slovaca

Similarity:

On a graph invariant related to the sum of all distances in a graph.

Dobrynin, A., Gutman, I. (1994)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity:

Graphs Which Are Switching Equivalent To Their Complementary Line Graphs II

Slobodan K. Simić (1982)

Publications de l'Institut Mathématique

Similarity:

A characterization of $K_{r, s}$ -closed graphs

Pavol Híc (1989)

Mathematica Slovaca

Similarity:

Degree sets for graphs

S. Kapoor, Albert Polimeni, Curtiss Wall (1977)

Fundamenta Mathematicae

Similarity: