F index of graphs based on four new operations related to the strong product
| Autor: | S. K. Ayyaswamy, Hanyuan Deng, D. Sarala, C. Natarajan |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Vertex (graph theory)
lcsh:Mathematics 010102 general mathematics Explained sum of squares subdivision of graph total graph 0102 computer and information sciences f index lcsh:QA1-939 strong product 01 natural sciences Total graph degree Graph Combinatorics chemistry.chemical_compound chemistry 010201 computation theory & mathematics Topological index Discrete Mathematics and Combinatorics Molecular graph 0101 mathematics Mathematics |
| Zdroj: | AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 1, Pp 25-37 (2020) |
| ISSN: | 2543-3474 0972-8600 |
| DOI: | 10.1016/j.akcej.2018.07.003 |
| Popis: | For a molecular graph, the first Zagreb index of a graph is equal to the sum of squares of the vertex degrees of the graph and the forgotten topological index (F-index) of a graph is defined as the sum of cubes of the vertex degrees of the graph. These parameters have applications in chemistry and drug structures. In this paper, we study the F index of strong product of two connected graphs in which one of the graphs is obtained by using four new sums called F sums of graphs and the other is any connected graph. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|