Dissertation > Excellent graduate degree dissertation topics show

# Some graphs relating to the zero-order generalized Randi (?) Pole figure index

Author: ChenShuBo
Tutor: DengHanYuan
School: Hunan Normal University
Course: Operational Research and Cybernetics
Keywords: Zero- order generalized Randi (?) Index Degree sequence Convert Pole figures
CLC: O157.5
Type: Master's thesis
Year: 2007
Quote: 0

### Abstract

 Let G = (V, E) be a simple connected graph , V (G) and E (G) the vertex set of G , respectively , and edge set , | V (G) | = n, | E (G) | = m G denote the number of vertices and edges . Graph G is zero-order generalized Randid index is defined as : where d v represent the degree of vertex v in G , α is any real number. Figure zero-order general Randic index is an important chemical graph theory, topological indices in chemistry has many applications , and has been extensively studied. (?) (N, n 1) represents the number of vertices is n, the number of edges connected to n 1 simple set of bicyclic graphs ; T n, d represents n vertices , diameter d tree set ; C (n, k) represents the top points is n, the number of turns of the set of k cacti . This degree of conversion in Fig Sequence of the (?) (N, n 1), T n, d , C (n, k) Fig these three general Randic index zero order . Depicts the complete (?) (N, n 1) has the maximum and minimum zero-order generalized dual loop diagram Randic index ; for a given diameter of the tree, cactus diagram is given on the α> 1 or α <0 for maximum zero -order general Randic index , and about 0 <α <1 the minimum zero-order general Randic index , and characterize the corresponding extremal map.

### Related Dissertations

CLC: > Mathematical sciences and chemical > Mathematics > Algebra,number theory, portfolio theory > Combinatorics ( combinatorics ) > Graph Theory
© 2012 www.DissertationTopic.Net  Mobile