Abdelhafid Modabish

• phd in applied mathematics
• Professor (Associate) at Sana'a University

This paper deals with some types of topological indices called valency-based indices or degree-Based Indices. Specifically, Multiplicative Forgotten, Multiplicative Yemen, modified Forgotten, modified Yemen, generalized modified first Zagreb, generalized modified sum connectivity, and generalized modified product connectivity indices of the benzeno...

Networks play an important role in electrical and electronic engineering. It depends on what area of electrical and electronic engineering, for example, there is a lot more abstract mathematics in communication theory and signal processing and networking, etc. Networks involve nodes communicating with each other. Graph theory has found considerable...

Cheminformatics is a modern field of chemistry information science and mathematics that is very much helpful in keeping the data and getting information about chemicals. A new two-dimensional carbon known as diphenylene was identified and synthesized. It is considered one of the materials that have many applications in most fields such as catalysis...

Topological indices have important role in theoretical chemistry. Among the Wiener index has been used more considerably than any other topological indices in chemical literature. In this study, we introduce a new graphs called conical graphs G(m, n) that generalizes the classic wheel graphs.The Wiener polynomial of G(m, n) has been computed. We pr...

A graph can be recognized by numeric number, polynomial or matrix which represent the whole graph. Topological index is a numerical descriptor of a molecule, based on a certain topological feature of the corresponding molecular graph, it is found that there is a strong correlation between the properties of chemical compounds and their molecular str...

Topological indices have important role in theoretical chemistry. Among the Wiener index has been used more considerably than any other topological indices in chemical literature. In this study, we introduce a new graphs called conical graphs G(m, n) that generalizes the classic wheel graphs.The Wiener polynomial of G(m, n) has been computed. We pr...

In this paper, we introduce Zagreb Indices of Some New Graphs. Exactly, first index, second index and forgotten index. New graphs are generated from the initial graphs by graph operations. We also created some possible applications on the Zagreb indices as special cases.

In this paper, we introduce Zagreb Indices of Some New Graphs. Exactly, first index, second index and forgotten index. New graphs are generated from the initial graphs by graph operations. We also created some possible applications on the Zagreb indices as special cases.

Let G and H be two graphs and G^c and H^c their complement respectively. We define new operation on graphs, called semi-complete product. In this paper, we compute some topological indices of the resulting graph by new operation (semi-complete product) of G and H, such as Wiener index, Hyper-Wiener index, Wiener polarity, Schultz index, Gutman inde...

The number of spanning trees of a graph G is the total number of distinct spanning subgraphs of G that are trees (tree that visiting all the vertices of the graph G). Let C n be a cycle with n vertices. The star flower planar map is a simple graph G formed from a cycle C n by adding a vertex adjacent to every edge of C n and we connect this vertex...

Graph theory is used to represent a communication network by expressing its linkage structure, the vertices represent objects and the pairs called edges or represent the interconnections between objects. The exact geometric positions of vertices or the lengths of the edges are not important. The purpose of this paper is to find a recursive relation...

The number of spanning trees of a map C is the total number of distinct spanning subgraphs of C that are trees. In this paper, we give some methods to facilitate the calculation of the number of spanning trees for planar maps and derive several simple formulas for the number of spanning trees of special families of maps called (n-Tent chains, n-Hom...

Calculating the number of spanning trees of a planar map by the determinant of Laplacian matrix is tedious and impractical. In this paper, we propose some methods to facilitate the calculation of the number of spanning trees for planar maps. We apply these methods to give the number of spanning trees of some special maps (n-Fan chains, n-Grid chain...

The number of spanning trees of a map C denoted by τ (C) is the total number of distinct spanning subgraphs of C that are trees. A maximal planar map is a simple graph G formed by n vertices, 3(n-2) edges and all faces having degree 3 [2]. In this paper, we derive the explicit formula for the number of spanning trees of the maximal planar map and d...

In trees with n vertices, the Wiener index of tree is minimized by stars and maximized by paths, both uniquely. In this paper, we give an inequality similar in the case of planar maps.

In trees with n vertices, the Wiener index of tree is minimized by stars and maximized by paths, both uniquely. In this paper, we give an inequality similar in the case of planar maps.