[PDF] Top 20 On Topological Indices of Subdivided and Line Graph of Subdivided Friendship Graph

... Topological indices [3, 4, 10, 11, 14, 15, 16, 20, 26] are important tools for analyzing some physicochemical properties of molecules without performing any ... See full document

... graph.A topological index is a numeric quantity which is derived from a molecular graph does not depend on labeling or pictorial representation of a ...their topological indices. Among ... See full document

... chemical graph theory, topological indices provide an important tool to quantify the molecular structure and it is found that there is a strong correlation between the properties of chemical ... See full document

... Topological indices are numerical quantities associated with a graph that are in- variant under graph ...in topological indices is due to their applicability in quantitative ... See full document

... subdivision. Topological indices of line graphs of subdivision graphs of complete bipartite graphs are computed by Islam et ...certain topological indices for the line ... See full document

... The line graph, [7], of the graph G, written L(G), is the simple graph whose vertices are the edges of G, with ef ϵ E(L(G)) when e and f have a common end point in ...of line ... See full document

... Topological indices of molecules can be carried out through their molecular ...molecular graph is a collection of points representing the atoms in the molecule and a set of lines representing the ... See full document

... gear graph has 2n + 1 vertices and 3n edges, among them n vertices are of degree two, n vertices of degree three and one vertex of degree ...the line graph of gear ... See full document

... new topological indices based on Zagreb indices are ...new topological indices are calculated for some stan- dard graphs and for the firefly ...new indices can be used to ... See full document

... It is well known and generally accepted that the problem of determining the domination number of an arbitrary graph is a difficult one. Because of this, researchers have turned their attention to the study of ... See full document

... A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. The most common type of vertex coloring seeks to minimize the number of ... See full document

... A graph in which every edge associates distinct values with multiples of 2 is called the sum of the cubes of the vertices and the sum of the squares of the ... See full document

... finite graph, then the only locally compact Hausdorff semigroup topology on G(E) is the discrete topology (Theorem ...Hausdorff topological inverse semigroup ... See full document

... Once more, the mechanism is equisymmetric with the cubic harmonic xyz . The mechanism is ‘generic’ for the three subdivisions of the graph of the cube. The full octahedral symmetry of W is in a sense an accident; ... See full document

... command line tools are called to parse files containing a graph definition and render a rasterized image of the ...command line, or invoking it in python by ... See full document

... of graph parameters, such as connectivity, toughness, scattering number, integrity, tenacity, and their edge-analogues, have been proposed for measuring the vulnerability of ...a graph as a new measure of ... See full document

... planar graph G, the vertex labeling function is defined as g : V(G){0,1} and g(v) is called the label of the vertex v of G under g, induced edge labeling function g * : E(G){0,1} is given as if e = uv then g * ... See full document

... are not two different types of analyses to be done for the global and local scales, just one with a very precise physical meaning: the efficiency in transporting information”. Due to the vague wording of “not sparse” we ... See full document

... Our aim in this paper is to study a new vulnerability parameter, called the average lower 2- domination number. In Section 2, well-known basic results are given for the average lower domination number, the average lower ... See full document

... A connected graph G is said to be k-transmission regular if Tr ( v ) = k for every vertex v ∈ V ( G ) . The transmission regular graphs are exactly the distance-balanced graphs introduced in [17]. They are also ... See full document