نتایج جستجو برای: edge szeged index
تعداد نتایج: 504990 فیلتر نتایج به سال:
The vertex version of detour index was defined during the works on connected graph in chemistry. The edge versions of detour index have been introduced ecently. In this paper, the explicit relations among edge versions of detour index have been declared and due to these relations, we compute the edge detour indices for some well-known graphs.
structural codes vis-a-vis structural counts, like polynomials of a molecular graph, areimportant in computing graph-theoretical descriptors which are commonly known astopological indices. these indices are most important for characterizing carbon nanotubes(cnts). in this paper we have computed sadhana index (sd) for phenylenes and theirhexagonal squeezes using structural codes (counts). sadhan...
János Varga1*, Krisztina Rigó1, Beáta Tóth2, József Téren3 and Zofia Kozakiewicz4 Department of Microbiology, Faculty of Sciences, University of Szeged, P.O. Box 533, H-6701 Szeged, Hungary Cereal Research Non-profit Company, P.O. Box 391, H-6701 Szeged, Hungary Animal Health and Food Control Station, P.O. Box 446, H-6701 Szeged, Hungary CABI Bioscience UK Centre, Bakeham Lane, Egham, Surrey TW...
E Szél, H Polyánka, K Szabó, P Hartmann, D Degovics, B Balázs, IB Németh, C Korponyai, E Csányi, J Kaszaki, S Dikstein, K Nagy, L Kemény, G Erős Department of Dermatology and Allergology, University of Szeged MTA SZTE Dermatological Research Group Institute of Surgical Research, University of Szeged Department of Pharmaceutical Technology, University of Szeged Unit of Cell Pharmacology, Hebrew ...
Forest’s ecosystem is one of the most important carbon sink of the terrestrial ecosystem. Remote sensing technology provides robust techniques to estimate biomass and solve challenges in forest resource assessment. The present study explored the potential of Sentinel-2 bands to estimate biomass and comparatively analyzed of red-edge band based and broadband derived vegetation indices. Broadband...
the vertex-edge wiener index of a simple connected graph g is defined as the sum of distances between vertices and edges of g. two possible distances d_1(u,e|g) and d_2(u,e|g) between a vertex u and an edge e of g were considered in the literature and according to them, the corresponding vertex-edge wiener indices w_{ve_1}(g) and w_{ve_2}(g) were introduced. in this paper, we present exact form...
Second Department of Medicine and Cardiology Center Medical Faculty University of Szeged H-6723 Szeged Semmelweis St. 6 Hungary P.O. Box 427 [email protected]. hu
Structural codes vis-a-vis structural counts, like polynomials of a molecular graph, are important in computing graph-theoretical descriptors which are commonly known as topological indices. These indices are most important for characterizing carbon nanotubes (CNTs). In this paper we have computed Sadhana index (Sd) for phenylenes and their hexagonal squeezes using structural codes (counts). Sa...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید