[PDF] Top 20 Wiener Index of a Cycle in the Context of Some Graph Operations

... of some standardized experiment. The Wiener index W(G) is a distance-based topological invariant is also a molecular descriptor, it much used in the study of the structure-property and the ... See full document

... molecular graph. A molecular graph is a collection of points representing the atoms in the molecule and set of lines representing the covalent ...in graph theory ...is Wiener index. It ... See full document

... several graph polynomials like PI polynomial [3], Tutte polynomial [14], matching polynomial [15,20], Schultz polynomial [25], Zang-Zang polynomial [46], ...as Wiener index [44], hyper Wiener ... See full document

... the Wiener index and the Wiener polarity index of G4 H and G 5 H ...The Wiener index [11] defined as the sum of distances between all vertex pairs in a connected ...the ... See full document

... the graph G, and it will be denoted by D(G). The Wiener index is of certain importance in chemistry ...studied graph-based molecular structure- descriptors (the so-called topological indices) ... See full document

... the graph. A connected graph without a cutvertex is called a non-separable ...a graph is a maximal non-separable subgraph. A cycle is a connected graph (or subgraph) in which every ... See full document

... connected graph with vertex and edge sets V(G) and E(G), ...a graph G, the degree of a vertex v is the number of edges incident to v , denoted by deg G v ...topological index Top(G) of a graph ... See full document

... distance-based graph invariants is the Wiener number W G ( ) , also termed as Wiener index in chemical or mathematical chemistry literature, which is defined [3] as the sum of distances over ... See full document

... The Wiener index is a graph invariant that has found extensive application in ...the Wiener polynomial, who’s derivate is a q-analog of the Wiener index was ...[The Wiener ... See full document

... smallest Wiener indies among all the unicycles ...of cycle length r with the smallest and the largest Hyper-Wiener indices for 3 ≤ r ≤ n, and the n-vertex unicyclic graphs with the smallest, the ... See full document

... d v v , between two vertices v i and v j in G is the length of a shortest path between the two vertices. The diameter of G is the greatest distance between two vertices of G , denoted by D G ( ). The Wiener ... See full document

... Gutman index which attracts more attention recently is defined by Klavžar and Gutman in [11, ...This index is also known as the Schultz index of the second kind but in this paper the first name is ... See full document

... Operations Research techniques can be very helpful in route optimization and improvement of resource utilization. It provides easy and convenient solution for better decision-making, saving time, resources and ... See full document

... Chandrashekar Adiga is a professor of mathematics at the University of Mysore, INDIA. His research interests are in the areas of Number Theory and Algebraic Graph Theory. He has published more than 150 research ... See full document

... and of ( ), denoted by ( , ), is the length of the shortest path joining them. The eccentricity of a vertex ∈ ( ), denoted by ( ), is the largest distance between and any other vertex of the graph . The radius r ... See full document

... A graph is constructed by the algorithm in which each node is an incompatible donor – recipient pair and each edge is a potential match between the two connecting ...the graph can be ... See full document

... Abstract:-Automation has revolutionized production management. It has become a part of multiple processes like assembling, testing, inspection and inventory management. The paper aims to understand industrial automation ... See full document

... theta graph. We also proved that the prime cordial labeling in the context of some graph operations namely duplication, witching, fusion, path union and the graph obtained by ... See full document

... Edge coloring has been an interesting subject in graph theory. From the problem of coloring a geographical map by using only four colors, the theory of graph coloring has originated and coloring the edges ... See full document

... One of the most competitive industries is the airline industry. This competition not only arises from peer air carriers, but also from ground transportation modes such as buses, trains, ships, and rental cars. In ... See full document