نتایج جستجو برای: szeged polynomial

تعداد نتایج: 98279  

2015
J. Meyer T. D. Thornberry A. W. Rollins Z. Bozóki D. Tátrai

J. Meyer, C. Rolf, C. Schiller, S. Rohs, N. Spelten, A. Afchine, M. Zöger, N. Sitnikov, T. D. Thornberry, A. W. Rollins, Z. Bozóki, D. Tátrai, V. Ebert, B. Kühnreich, P. Mackrodt, O. Möhler, H. Saathoff, K. H. Rosenlof, and M. Krämer Institut für Energie und Klimaforschung 7, Forschungszentrum Jülich, 52425 Jülich, Germany Institut für Energie und Klimaforschung 8, Forschungszentrum Jülich, 524...

2014
Henrik Winkler Harald Woracek H. Woracek

. The spectral theory of the equation changes depending on the growth of H towards the endpoint s+; the classical distinction into the Weyl alternatives ‘limit point’ or ‘limit circle’ case. A refined measure for the growth of a limit point Hamiltonian H can be obtained by comparing with Hpolynomials. This growth measure is concretised by a number∆(H) ∈ N0∪{∞} and appeared first in connection w...

2014
Antal Berényi Zoltán Somogyvári Anett J. Nagy Lisa Roux John D. Long Shigeyoshi Fujisawa Eran Stark Anthony Leonardo Timothy D. Harris György Buzsáki

Antal Berényi, Zoltán Somogyvári, Anett J. Nagy, Lisa Roux, John D. Long, Shigeyoshi Fujisawa, Eran Stark, Anthony Leonardo, Timothy D. Harris, and György Buzsáki New York University Neuroscience Institute, School of Medicine, New York University, New York, New York; Center for Molecular and Behavioral Neuroscience, Rutgers, The State University of New Jersey, Newark, New Jersey; MTA-SZTE “Mome...

2012
Xianyong Li Xiaofan Yang Guoping Wang Rongwei Hu

The vertex Padmakar-Ivan (PIv) index of a graph G was introduced as the sum over all edges e = uv of G of the number of vertices which are not equidistant to the vertices u and v. In this paper we provide an analogue to the results of T. Mansour and M. Schork [The PI index of bridge and chain graphs, MATCH Commun. Math. Comput. Chem. 61 (2009) 723-734]. Two efficient formulas for calculating th...

2014
János Tajti

Szeged 2014 2 "Discovery consists of seeing what everybody has seen and thinking what nobody has thought."

2017
K. Pattabiraman P. Kandan P. KANDAN

The weighted Szeged index of a connected graph G is defined as Szw(G) = ∑ e=uv∈E(G) ( dG(u) + dG(v) ) nu (e)n G v (e), where n G u (e) is the number of vertices of G whose distance to the vertex u is less than the distance to the vertex v in G. In this paper, we have obtained the weighted Szeged index Szw(G) of the splice graph S(G1, G2, y, z) and link graph L(G1, G2, y, z).

Journal: :Mathematical and Computer Modelling 2010

2005
Péter Lajkó Enrico Carlon Heiko Rieger Ferenc Iglói

Péter Lajkó,1 Enrico Carlon,2 Heiko Rieger,3 and Ferenc Iglói4,5 1Department of Physics, Kuwait University, P.O. Box 5969, Safat 13060, Kuwait 2Interdisciplinary Research Institute c/o IEMN, Cité Scientifique Boîte Postale 60069, F-59652 Villeneuve d’Ascq, France 3Theoretische Physik, Universität des Saarlandes, D-66041 Saarbrücken, Germany 4Research Institute for Solid State Physics and Optics...

Journal: :Ars Comb. 2008
A. Mahmiani A. Iranmanesh Y. Pakravesh

Abstract Topological indices of nanotubes are numerical descriptors that are derived from graph of chemical compounds. Such indices based on the distances in graph are widely used for establishing relationships between the structure of nanotubes and their physico-chemical properties. The Szeged index is obtained as a bond additive quantity where bond contributions are given as the product of th...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید