F-index of graphs based on new operations related to the join of graphs

09/19/2017
by   Prosanta Sarkar, et al.
0

The forgotten topological index or F-index of a graph is defined as the sum of degree cube of all the vertices of the graph. This index was introduced by Gutman and Trinajestić more than 40 years ago. In this paper, we derive F-index of new operations of subdivision graphs related to the graphs join.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/04/2021

New upper bounds for the forgotten index among bicyclic graphs

The forgotten topological index of a graph G, denoted by F(G), is define...
research
02/14/2023

On the degree-Kirchhoff index, Gutman index and the Schultz index of pentagonal cylinder/ Möbius chain

The degree-Kirchhoff index of a graph is given by the sum of inverses of...
research
06/21/2021

A Logical Model for joining Property Graphs

The present paper upgrades the logical model required to exploit materia...
research
06/19/2023

On the Rényi index of random graphs

Networks (graphs) permeate scientific fields such as biology, social sci...
research
08/28/2023

Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index

Asymptotic separation index is a parameter that measures how easily a Bo...
research
08/29/2021

The Popularity-Homophily Index: A new way to measure Homophily in Directed Graphs

In networks, the well-documented tendency for people with similar charac...
research
06/30/2021

Energy and Randic index of directed graphs

The concept of Randic index has been extended recently for a digraph. We...

Please sign up or login with your details

Forgot password? Click here to reset