Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2014

Highly Cited

2014

In the class of Kragujevac trees, the elements having minimal atom{bond connectivity index are determined. By this, an earlier… Expand

2013

2013

We give tight upper and lower bounds for the additive degree-Kirchhoff index of a connected undirected graph.

2013

2013

G u v v N u S d ∈ =� and NG(u)={v ∈V(G)|uvE(G)}. In this paper, formula for calculating the above topological descriptor in… Expand

2010

2010

We show in a simple way that for any $k,m\in{\Bbb N}$, there exists a tree $T$ such that the number of independent sets of $T$ is… Expand

2009

2004

2004

Full Paper Recently, the COmmon REactivity PAttern (COREPA) approach was developed as a probabilistic classification method which… Expand

Highly Cited

2004

Highly Cited

2004

Biological systems have evolved branching networks that transport a variety of resources. We argue that common properties of… Expand

2004

2004

We give a classification of subdivision refinement rules using similarity transformations of lattices. Our work expands recent… Expand

2003

2003

A brief description is given of the historical development of mathematics and chemistry. A path leading to the meeting of these… Expand

2002

2002

A simple bijection is established between Morgan trees and Dyck paths. As a consequence, exact enumerative results for Morgan… Expand