2000 character limit reached
F-index of graphs based on new operations related to the join of graphs
Published 19 Sep 2017 in math.CO and cs.DM | (1709.06301v1)
Abstract: 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\'{c} more than 40 years ago. In this paper, we derive F-index of new operations of subdivision graphs related to the graphs join.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.