Graphs with smallest forgotten index

Authors

Abstract:

The forgotten topological index of a molecular graph $G$ is defined as $F(G)=sum_{vin V(G)}d^{3}(v)$, where $d(u)$ denotes the degree of vertex $u$ in $G$. The first through the sixth smallest forgotten indices among all trees, the first through the third smallest forgotten indices among all connected graph with cyclomatic number $gamma=1,2$, the first through the fourth for $gamma=3$, and the first and the second for $gamma=4,5$ are determined. These results are compared with those obtained for the first Zagreb index.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

The smallest Hosoya index of unicyclic graphs with given diameter∗

The Hosoya index of a (molecular) graph is defined as the total number of the matchings, including the empty edge set, of this graph. Let Un,d be the set of connected unicyclic (molecular) graphs of order n with diameter d. In this paper we completely characterize the graphs from Un,d minimizing the Hosoya index and determine the values of corresponding indices. Moreover, the third smallest Hos...

full text

Remark on Forgotten Topological Index of a Line Graphs

Let G be a simple connected graph with n vertices and m edges and let d(e1) > d(e2) > · · · > d(em) be edge degree sequence of graph G. Denote by EF = ∑m i=1 d(ei) 3 reformulated forgotten index of G. Lower and upper bounds for the invariant EF are obtained.

full text

Constructing regular graphs with smallest defining number

In a given graph G, a set S of vertices with an assignment of colors is a defining set of the vertex coloring of G, if there exists a unique extension of the colors of S to a χ(G)-coloring of the vertices of G. A defining set with minimum cardinality is called a smallest defining set (of vertex coloring) and its cardinality, the defining number, is denoted by d(G, χ). Let d(n, r, χ = k) be the ...

full text

Smallest graphs with distinct singleton centers

An incredible number of centrality indices has been proposed to date (Todeschini & Consonni, 2009). Four of them, however, can be considered prototypical because they operationalize distinct concepts of centrality and together cover the bulk of analyses and empirical uses: degree, closeness, betweenness, and eigenvector centrality. In teaching any mathematical science, it is instructive to cons...

full text

On the forgotten topological index

The forgotten topological index is defined as sum of third power of degrees. In this paper, we compute some properties of forgotten index and then we determine it for some classes of product graphs.

full text

Biprimitive Graphs of Smallest Order

A regular and edge-transitive graph which is not vertex-transitive is said to be semisymmetric. Every semisymmetric graph is necessarily bipartite, with the two parts having equal size and the automorphism group acting transitively on each of these parts. A semisymmetric graph is called biprimitive if its automorphism group acts primitively on each part. In this paper biprimitive graphs of smal...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 8  issue 3

pages  259- 273

publication date 2017-09-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023