Ljiljana Pavlović
Research Subjects
Research Interests
Ljiljana Pavlović has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
Bolian Liu
School of Mathematical Science, South China Normal University, Guangzhou, P.R. China
2 shared publications- Ivan Gutman
Faculty of Science, University of Kragujevac, Kragujevac, Serbia
2 shared publications Milica Milivojević
2 shared publicationsTomica Divnić
Faculty of Science, University of Kragujevac, Kragujevac, Serbia
2 shared publicationsTomica R. Divnić
2 shared publicationsGilles Caporossi
1 shared publication
Latest Publications
- 15 June 2022
- Published by Springer Nature in Annals of Operations Research
- Vol. 316 (2) , 1257-1266
On the extremal geometric–arithmetic graphs with fixed number of vertices having minimum degree
- 15 June 2022
- Published by Springer Nature in Annals of Operations Research
- Vol. 316 (2) , 1257-1266
On the extremal geometric–arithmetic graphs with fixed number of vertices having minimum degree
- 1 January 2017
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 217, 286-293
The variation of the Randić index with regard to minimum and maximum degree
- 1 January 2017
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 217, 286-293
The variation of the Randić index with regard to minimum and maximum degree
- 10 March 2014
- Published by Taylor & Francis in Optimization
- Vol. 64 (9) , 2021-2038
Extremal graphs for the Randić index when minimum, maximum degrees and order of graphs are odd
Let be the set of connected simple n-vertex graphs with minimum vertex degree and maximum vertex degree . The Randić index of a graph G is defined by , where is the degree of vertex u and the summation extends over all edges uv of G. In this paper, we find for , and k, m, n are odd, extremal graphs in for which the Randić index attains its minimum value. We show that the extremal graphs have vertices of degree k, m and , the number of vertices of degree is one and the number of vertices of degree k is as close to as possible.
- 10 March 2014
- Published by Taylor & Francis in Optimization
- Vol. 64 (9) , 2021-2038
Extremal graphs for the Randić index when minimum, maximum degrees and order of graphs are odd
Let be the set of connected simple n-vertex graphs with minimum vertex degree and maximum vertex degree . The Randić index of a graph G is defined by , where is the degree of vertex u and the summation extends over all edges uv of G. In this paper, we find for , and k, m, n are odd, extremal graphs in for which the Randić index attains its minimum value. We show that the extremal graphs have vertices of degree k, m and , the number of vertices of degree is one and the number of vertices of degree k is as close to as possible.
- 1 January 2014
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 162, 386-390
Extremal graphs for the geometric–arithmetic index with given minimum degree
- 1 January 2014
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 162, 386-390
Extremal graphs for the geometric–arithmetic index with given minimum degree
- 1 May 2013
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 161 (7-8) , 953-960
Proof of the first part of the conjecture of Aouchiche and Hansen about the Randić index
- 1 May 2013
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 161 (7-8) , 953-960
Proof of the first part of the conjecture of Aouchiche and Hansen about the Randić index
- 1 February 2013
- Published by Elsevier in Discrete Mathematics
- Vol. 313 (3) , 225-235
On the conjecture of Aouchiche and Hansen about the Randić index
- 1 February 2013
- Published by Elsevier in Discrete Mathematics
- Vol. 313 (3) , 225-235
On the conjecture of Aouchiche and Hansen about the Randić index
- Open Access
- 1 January 2012
- Published by National Library of Serbia in Yugoslav Journal of Operations Research
- Vol. 22 (1) , 107-114
A slight modification of the first phase of the simplex algorithm
In this paper we give a modification of the first phase procedure for transforming the linear programming problem, given in the standard form min{cTx Ax=b, x?0}, to the canonical form, i.e., to the form with one feasible primal basis where standard simplex algorithm can be applied directly. The main idea of the paper is to avoid adding m artificial variables in the first phase. Instead, Step 2 of the proposed algorithm transforms the problem into the form with m?1 basic columns. Step 3 is then iterated until the m?th basic column is obtained, or it is concluded that the feasible set of LP problem is empty.
- 1 January 2012
- Published by National Library of Serbia in Yugoslav Journal of Operations Research
- Vol. 22 (1) , 107-114
Open AccessA slight modification of the first phase of the simplex algorithm
In this paper we give a modification of the first phase procedure for transforming the linear programming problem, given in the standard form min{cTx Ax=b, x?0}, to the canonical form, i.e., to the form with one feasible primal basis where standard simplex algorithm can be applied directly. The main idea of the paper is to avoid adding m artificial variables in the first phase. Instead, Step 2 of the proposed algorithm transforms the problem into the form with m?1 basic columns. Step 3 is then iterated until the m?th basic column is obtained, or it is concluded that the feasible set of LP problem is empty.
- 1 November 2010
- Published by Elsevier in European Journal of Operational Research
- Vol. 207 (1) , 539-542
Comment on “Complete solution to a conjecture on Randić index”
- 1 November 2010
- Published by Elsevier in European Journal of Operational Research
- Vol. 207 (1) , 539-542
Comment on “Complete solution to a conjecture on Randić index”
- 1 July 2009
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 157 (13) , 2938-2944
More on “Connected (n, m)-graphs with minimum and maximum zeroth-order general Randić index”
- 1 July 2009
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 157 (13) , 2938-2944
More on “Connected (n, m)-graphs with minimum and maximum zeroth-order general Randić index”
- 1 November 2007
- Published by Wiley in International Transactions in Operational Research
- Vol. 14 (6) , 535-545
The linear programming approach to the Randić index
- 1 November 2007
- Published by Wiley in International Transactions in Operational Research
- Vol. 14 (6) , 535-545
The linear programming approach to the Randić index