#### Filter Results:

- Full text PDF available (24)

#### Publication Year

2002

2017

- This year (1)
- Last 5 years (10)
- Last 10 years (24)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ali Reza Ashrafi, Tomislav Doslic, Asma Hamzeh
- Discrete Applied Mathematics
- 2010

Recently introduced Zagreb coindices are a generalization of classical Zagreb indices of chemical graph theory. We explore here their basic mathematical properties and present explicit formulae for these new graph invariants under several graph operations.

- Tomislav Doslic, Damir Vukicevic
- Discrete Applied Mathematics
- 2007

- Yaser Alizadeh, Ali Iranmanesh, Tomislav Doslic
- Discrete Mathematics
- 2013

We introduce a modification of the Harary index where the contributions of vertex pairs are weighted by the sum of their degrees. After establishing basic mathematical properties of the new invariant, we proceed by finding the extremal graphs and investigating its behavior under several standard graph products.

- Tomislav Doslic
- Int. J. Math. Mathematical Sciences
- 2005

We consider log-convex sequences that satisfy an additional constraint imposed on their rate of growth. We call such sequences log-balanced. It is shown that all such sequences satisfy a pair of double inequalities. Sufficient conditions for log-balancedness are given for the case when the sequence satisfies a two(or more-) term linear recurrence. It is… (More)

- Damir Vukicevic, Tomislav Doslic
- Australasian J. Combinatorics
- 2007

- Tomislav Doslic, Frode Måløy
- Discrete Mathematics
- 2010

A sequence (xn)n 0 of positive real numbers is log-convex if the inequality xn xn−1xn+1 is valid for all n 1 . We show here how the problem of establishing the log-convexity of a given combinatorial sequence can be reduced to examining the ordinary convexity of related sequences. The new method is then used to prove that the sequence of Motzkin numbers is… (More)

- Franka Miriam Brückler, Tomislav Došlić, Ante Graovac, Ivan Gutman
- 2011

A new class of distance–based molecular structure descriptors is put forward, aimed at eliminating a general shortcoming of the Wiener and Wiener–type indices, namely that the greatest contributions to their numerical values come from vertex pairs at greatest distance. The Q-indices, considered in this work, consist of contributions of vertex pairs that… (More)

- Douglas J. Klein, Tomislav Doslic, Danail Bonchev
- Discrete Applied Mathematics
- 2007

Valence-weightings are considered for shortest-path distance moments, as well as related weightings for the so-called “Wiener” polynomial. In the case of trees the valence-weighted quantities are found to be expressible as a combination of unweighted quantities. Further the weighted quantities for a so-called “thorny” graph are considered and shown to be… (More)

- Zahra Yarahmadi, Tomislav Doslic, Ali Reza Ashrafi
- Discrete Applied Mathematics
- 2010

The smallest number of edges that have to be deleted from a graph to obtain a bipartite spanning subgraph is called the bipartite edge frustration of G and denoted by φ(G). In this paper we determine the bipartite edge frustration of some classes of composite graphs. © 2010 Elsevier B.V. All rights reserved.