- citati u SCIndeksu: 0
- citati u CrossRef-u:[5]
- citati u Google Scholaru:[]
- posete u poslednjih 30 dana:10
- preuzimanja u poslednjih 30 dana:10
|
|
|
On Merrifield-Simmons index of molecular graphs
(naslov ne postoji na srpskom)
aUniverzitet u Kragujevcu, Prirodno-matematički fakultet, Srbija + Džavni univerzitet u Novom Pazaru, Srbija bDepartment of Mathematics, Faculty of Science, Atat¨urk University, Erzurum, Turkey cDepartment of Elemantary Mathematics Education, Faculty of Education, Bayburt University, Bayburt, Turkey
e-adresa: gutman@kg.ac.rs, igultekin@atauni.edu.tr, shnbnymn25@gmail.com
Projekat: Scientific and Technological Research Council of Turkey (TÜBITAK)
Sažetak
(ne postoji na srpskom)
The Merrifield-Simmons index σ = σ(G) of a graph G is the number of independent vertex sets of G. This index can be calculated recursively and expressed in terms of Fibonacci numbers. We determine the molecular graphs for which σ can be recursively calculated in a single step.
|
|
|
Reference
|
2
|
Gutman, I., Polansky, O.E. (1986) Mathematical concepts in organic chemistry. Berlin: Springer
|
|
Gutman, I. (1991) Topological properties of benzenoid systems: Merrifield-Simmons indices and independence polynomials of unbranched catafusenes. Rev Roum Chim, 36, 379-388
|
1
|
Hua, H., Xu, X., Wang, H. (2014) Unicyclic graphs with given number of cut vertices and the maximal Merrifield-Simmons index. Filomat, 28(3): 451-461
|
|
Linek, V. (1989) Bipartite graphs can have any number of independent sets. Discrete Mathematics, 76, 2, 131-136
|
|
Liu, Y., Zhuang, W., Liang, Z. (2015) Largest Hosoya index and smallest Merrifield-Simmons index in tricyclic graphs. MATCH Commun. Math. Comput. Chem., 73, 195-224
|
|
Merrifield, R. E., Simmons, H. E. (1985) Topology of bonding in -electron systems. Proceedings of the National Academy of Sciences, 82(1): 1-3
|
|
Merrifield, R.E., Simmons, H.E. (1981) Enumeration of structure-sensitive graphical subsets: Theory. Proc Natl Acad Sci USA, 78, 2, 692-695
|
|
Merrifield, R.E., Simmons, H.E. (1981) Enumeration of structure-sensitive graphical subsets: Calculations. Proc Natl Acad Sci USA, 78, 1, 1329-1332
|
|
Merrifield, R.E., Simmons, H.E. (1980) The structure of molecular topological spaces. Theoretica Chimica Acta, 55, 55-75
|
1
|
Merrifield, R.E., Simmons, H.E. (1989) Topological methods in chemistry. New York, itd: Wiley
|
|
Simmons, H. E., Merrifield, R. E. (1977) Mathematical description of molecular structure: Molecular topology. Proceedings of the National Academy of Sciences, 74(7): 2616-2619
|
|
Trinks, M. (2015) The Merrifield-Simmons conjecture also holds for parity graphs. Int. J. Graph Theory Appl., 1, 111-121
|
2
|
Wagner, S., Gutman, I. (2010) Maxima and Minima of the Hosoya Index and the Merrifield-Simmons Index. Acta Applicandae Mathematicae, 112(3): 323-346
|
|
Yu, Q., Zhu, Z. (2015) The extremal fully loaded graphs with respect to Merrifield-Simmons index. Ars Comb., 122, 399-409
|
|
Zhu, Z., Yuan, C., Andriantiana, E.O.D., Wagner, S. (2014) Graphs with maximal Hosoya index and minimal Merrifield–Simmons index. Discrete Mathematics, 329: 77-87
|
|
|
|