A Linear Algorithm for the Hyper-Wiener Index of Chemical Trees

2001 ◽  
Vol 41 (4) ◽  
pp. 958-963 ◽  
Author(s):  
Roberto Aringhieri ◽  
Pierre Hansen ◽  
Federico Malucelli
Keyword(s):  
Wiener Index ◽  
Linear Algorithm ◽  
Chemical Trees

Extremal trees with respect to the Steiner Wiener index

2019 ◽  
Vol 11 (06) ◽  
pp. 1950067
Author(s):  
Jie Zhang ◽  
Guang-Jun Zhang ◽  
Hua Wang ◽  
Xiao-Dong Zhang
Keyword(s):  
Maximum Degree ◽  
Computational Analysis ◽  
Degree Sequence ◽  
Wiener Index ◽  
Extremal Problems ◽  
Difficult Problem ◽  
Computational Results ◽  
Number Of Leaves ◽  
Extremal Structure ◽  
Chemical Trees

The well-known Wiener index is defined as the sum of pairwise distances between vertices. Extremal problems with respect to it have been extensively studied for trees. A generalization of the Wiener index, called the Steiner Wiener index, takes the sum of minimum sizes of subgraphs that span [Formula: see text] given vertices over all possible choices of the [Formula: see text] vertices. We consider the extremal problems with respect to the Steiner Wiener index among trees of a given degree sequence. First, it is pointed out minimizing the Steiner Wiener index in general may be a difficult problem, although the extremal structure may very likely be the same as that for the regular Wiener index. We then consider the upper bound of the general Steiner Wiener index among trees of a given degree sequence and study the corresponding extremal trees. With these findings, some further discussion and computational analysis are presented for chemical trees. We also propose a conjecture based on the computational results. In addition, we identify the extremal trees that maximize the Steiner Wiener index among trees with a given maximum degree or number of leaves.

scholarly journals Extremal Chemical Trees

2002 ◽  
Vol 57 (1-2) ◽  
pp. 49-51
Author(s):  
Miranca Fischermann ◽  
Ivan Gutman ◽  
Arne Hoffmann ◽  
Dieter Rautenbach ◽  
Dušica Vidovića ◽  
...  
Keyword(s):  
Carbon Atom ◽  
Molecular Graph ◽  
Chemical Properties ◽  
Wiener Index ◽  
Graph Representation ◽  
Hosoya Index ◽  
Saturated Hydrocarbons ◽  
Physico Chemical ◽  
Graph Energy ◽  
Chemical Trees

A variety of molecular-graph-based structure-descriptors were proposed, in particular the Wiener index W. the largest graph eigenvalue λ1, the connectivity index X, the graph energy E and the Hosoya index Z, capable of measuring the branching of the carbon-atom skeleton of organic compounds, and therefore suitable for describing several of their physico-chemical properties. We now determine the structure of the chemical trees (= the graph representation of acyclic saturated hydrocarbons) that are extremal with respect to W , λ1, E, and Z. whereas the analogous problem for X was solved earlier. Among chemical trees with 5. 6, 7, and 3k + 2 vertices, k = 2,3,..., one and the same tree has maximum λ1 and minimum W, E, Z. Among chemical trees with 3k and 3k +1 vertices, k = 3,4...., one tree has minimum 11 and maximum λ1 and another minimum E and Z .

Extremal Chemical Trees

2002 ◽  
Vol 57 (9-10) ◽  
pp. 49-52 ◽  
Author(s):  
Miranca Fischermann ◽  
Ivan Gutmana ◽  
Arne Hoffmann ◽  
Dieter Rautenbach ◽  
Dušica Vidović ◽  
...  
Keyword(s):  
Carbon Atom ◽  
Molecular Graph ◽  
Chemical Properties ◽  
Wiener Index ◽  
Graph Representation ◽  
Hosoya Index ◽  
Saturated Hydrocarbons ◽  
Physico Chemical ◽  
Graph Energy ◽  
Chemical Trees

Avariety of molecular-graph-based structure-descriptors were proposed, in particular the Wiener index W, the largest graph eigenvalue λ1, the connectivity index χ, the graph energy E and the Hosoya index Z, capable of measuring the branching of the carbon-atom skeleton of organic compounds, and therefore suitable for describing several of their physico-chemical properties. We now determine the structure of the chemical trees (= the graph representation of acyclic saturated hydrocarbons) that are extremal with respect to W, λ1, E, and Z, whereas the analogous problem for χ was solved earlier. Among chemical trees with 5, 6, 7, and 3k + 2 vertices, k = 2, 3,..., one and the same tree has maximum λ1 and minimum W, E, Z. Among chemical trees with 3k and 3k + 1 vertices, k = 3, 4..., one tree has minimum W and maximum λ1 and another minimum E and Z.

The Average Wiener Index of Trees and Chemical Trees

1999 ◽  
Vol 39 (4) ◽  
pp. 679-683 ◽  
Author(s):  
Andrey A. Dobrynin ◽  
Ivan Gutman
Keyword(s):  
Wiener Index ◽  
Chemical Trees

Allelopathic and Medicinal plant. 26. Millettia speciosa

2020 ◽  
Vol 51 (2) ◽  
pp. 125-146
Author(s):  
Nasiruddin Nasiruddin ◽  
Yu Zhangxin ◽  
Ting Zhao Chen Guangying ◽  
Minghui Ji
Keyword(s):  
Community Structure ◽  
Medicinal Plant ◽  
Gel Electrophoresis ◽  
Denaturing Gradient Gel Electrophoresis ◽  
Wiener Index ◽  
Pseudomonas Spp ◽  
Evenness Index ◽  
Gradient Gel Electrophoresis ◽  
Rhizosphere Pseudomonas

We grew cucumber in pots in greenhouse for 9-successive cropping cycles and analyzed the rhizosphere Pseudomonas spp. community structure and abundance by PCR-denaturing gradient gel electrophoresis and quantitative PCR. Results showed that continuous monocropping changed the cucumber rhizosphere Pseudomonas spp. community. The number of DGGE bands, Shannon-Wiener index and Evenness index decreased during the 3rd cropping and thereafter, increased up to the 7th cropping, however, however, afterwards they decreased again. The abundance of Pseudomonas spp. increased up to the 5th successive cropping and then decreased gradually. These findings indicated that the structure and abundance of Pseudomonas spp. community changed with long-term cucumber monocropping, which might be linked to soil sickness caused by its continuous monocropping.

T Wiener Index of Fibonacci Labeled Graph Pn ʘ F4

2018 ◽  
Vol 9 (11) ◽  
pp. 1712-1716
Author(s):  
R. Palanikumar ◽  
A. Rameshkumar
Keyword(s):  
Wiener Index ◽  
Labeled Graph

Wiener index of hexagonal chains under some transformations

2020 ◽  
Vol 3 (1) ◽  
pp. 28-36 ◽  
Author(s):  
Andrey A. Dobrynin ◽  
◽  
Ehsan Estaji ◽  
◽  
Keyword(s):  
Wiener Index

Sistem Pendukung Keputusan Pemilihan Taksi Berbasis Web dengan Algoritma Pencarian Linear

2016 ◽  
Vol 7 (2) ◽  
pp. 148-154
Author(s):  
Bimo Satriantoro ◽  
Ni Made Satvika Iswari
Keyword(s):  
Public Transportation ◽  
Time Variable ◽  
Variable Speed ◽  
Linear Algorithm ◽  
High Interest ◽  
Distance Variable ◽  
Google Apps

Indonesian people have a high interest for public transportation. There are few kind of public transportation, and taxi is one of them. Taxi use taximeter to calculate passanger fares. Taximeters between taxi companies are different in term of results although using the same equation and principle. The total fare from the taximeter is based on equation that includes distance variable, speed of the vehicle, and time variable. People have a problem to choose taxi because of the differnces of taximeter fares and taxi pool. Based on the problem, the solution is an application to help customer to decide choosing taxi. The application will help customer by giving informations about taximeter and carpool form two different company. The informations are based on the distance of the start point and the finish point of the customer and based on the distances of the customer and the carpool of the taxy company that will processed trough the application to calculating the total fares for the customer between two taxi companies. By using algorithm for linear searching, customer will get the informations to help them to decide which taxi the customer will use. Keywords: Linear Algorithm, Taximeter, Google Apps, Choice, Taxi

Sign in / Sign up

Export Citation Format

Share Document