Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: J Comb Optim

Search In Journal Title:

Abbravation: Journal of Combinatorial Optimization

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1016/0141-3910(85)90115-6

Search In DOI:

ISSN

1573-2886

Search In ISSN:
Search In Title Of Papers:

Extremal polyomino chains with respect to general

Authors: Mingqiang An Liming Xiong
Publish Date: 2014/08/06
Volume: 31, Issue: 2, Pages: 635-647
PDF Link

Abstract

For a molecular graph G the general Randić index R alpha G is defined as the sum of the weights d ud valpha of all edges uv of G where d u or d v denotes the degree of a vertex u or v in G and alpha is an arbitrary real number In this paper we give an efficient formula for computing the general Randić index of polyomino chains and characterize the extremal polyomino chains with respect to this index which generalizes one of the main results in Yarahmadi et al Appl Math Lett 25166–171 2012The authors would like to thank the anonymous referees for their valuable comments and suggestions which helped to improve the presentation of the paper This work is supported by the Natural Science Funds of China No 11071016 11171129 and 11001197 and by Specialized Research Fund for the Doctoral Program of Higher Education No 20131101110048

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. A Lagrangian bound for many-to-many assignment problems
  2. New bounds for the balloon popping problem
  3. An exact algorithm for the maximum probabilistic clique problem
  4. A two-stage method for member selection of emergency medical service
  5. Budget-constrained minimum cost flows
  6. On the complexity of partitioning a graph into a few connected subgraphs
  7. Median problems with positive and negative weights on cycles and cacti
  8. The unconstrained binary quadratic programming problem: a survey
  9. Multiple L ( j ,1)-labeling of the triangular lattice
  10. A hybrid algorithm based on variable neighbourhood for the strip packing problem
  11. Penalty guided genetic search for redundancy optimization in multi-state series-parallel power system
  12. Evaluation performance of genetic algorithm and tabu search algorithm for solving the Max-RWA problem in all-optical networks
  13. Modified differential evolution with self-adaptive parameters method
  14. The weighted link ring loading problem
  15. A new recombination lower bound and the minimum perfect phylogenetic forest problem
  16. Optimization of loss-balanced multicast in all-optical WDM networks
  17. Reconfiguration of dominating sets
  18. Approximate event detection over multi-modal sensing data
  19. Mobile facility location: combinatorial filtering via weighted occupancy
  20. Bounded information dissemination in multi-channel wireless networks
  21. Total coloring of planar graphs without adjacent short cycles
  22. Disjunctive total domination in graphs
  23. A quadratic lower bound for colourful simplicial depth
Search Result: