Search

Graph coloring is one of the most studied problems in graph theory due to its important applications in task scheduling and pattern recognition. The main aim of the problem is to assign colors to the elements of a graph such as vertices and/or edges subject to certain constraints. The 1-harmonious coloring is a kind of vertex coloring such that the color pairs of end vertices of every edge are different only for adjacent edges and the optimal constraint that the least number of colors is to be used. In this paper, we investigate the graphs in which we attain the sharp bound on 1-harmonious coloring. Our investigation consists of a collection of basic graphs like a complete graph, wheel, star, tree, fan, and interconnection networks such as a mesh-derived network, generalized honeycomb network, complete multipartite graph, butterfly, and Benes networks. We also give a systematic and elegant way of coloring for these structures.

The methods of measuring the complexity (spanning trees) in a finite graph, a problem related to various areas of mathematics and physics, have been inspected by many mathematicians and physicists. In this work, we defined some classes of pyramid graphs created by a gear graph then we developed the Kirchhoff’s matrix tree theorem method to produce explicit formulas for the complexity of these graphs, using linear algebra, matrix analysis techniques, and employing knowledge of Chebyshev polynomials. Finally, we gave some numerical results for the number of spanning trees of the studied graphs.

Topological indices are graph invariants computed by the distance or degree of vertices of the molecular graph. In chemical graph theory, topological indices have been successfully used in describing the structures and predicting certain physicochemical properties of chemical compounds. In this paper, we propose a definition of generalized bridge molecular graphs that can model more kinds of long chain polymerization products than the bridge molecular graphs, and provide some results of the edge versions of atom-bond connectivity ( A B C e ) and geometric arithmetic ( G A e ) indices for some generalized bridge molecular graphs, which have regular, periodic and symmetrical structures. The results of this paper offer promising prospects in the applications for chemical and material engineering, especially in chemical industry research.

A Topological index also known as connectivity index is a type of a molecular descriptor that is calculated based on the molecular graph of a chemical compound. Topological indices are numerical parameters of a graph which characterize its topology and are usually graph invariant. In QSAR/QSPR study, physico-chemical properties and topological indices such as Randić, atom-bond connectivity (ABC) and geometric-arithmetic (GA) index are used to predict the bioactivity of chemical compounds. Graph theory has found a considerable use in this area of research. In this paper, we study HDCN1(m,n) and HDCN2(m,n) of dimension m , n and derive analytical closed results of general Randić index R α ( G ) for different values of α . We also compute the general first Zagreb, ABC, GA, A B C 4 and G A 5 indices for these Hex derived cage networks for the first time and give closed formulas of these degree-based indices.

The definition of a Detour⁻Harary index is ω H ( G ) = 1 2 ∑ u , v ∈ V ( G ) 1 l ( u , v | G ) , where G is a simple and connected graph, and l ( u , v | G ) is equal to the length of the longest path between vertices u and v. In this paper, we obtained the maximum Detour⁻Harary index about unicyclic graphs, bicyclic graphs, and cacti, respectively.

The generalization of Farey graphs and extended Farey graphs all originate from Farey graphs. They are simultaneously scale-free and small-world. A labeling of the vertices for them are proposed here. All of the shortest paths between any two vertices in these two graphs can be determined only on their labels. The number of shortest paths between any two vertices is the product of two Fibonacci numbers; it is increasing almost linearly with the order or size of the graphs. However, the label-based routing algorithm runs in logarithmic time O(logn). Our efficient routing protocol for Farey-type models should help contribute toward the understanding of several physical dynamic processes.

Chemical graph theory plays an important role in modeling and designing any chemical structure. The molecular topological descriptors are the numerical invariants of a molecular graph and are very useful for predicting their bioactivity. In this paper, we study the chemical graph of the crystal structure of titanium difluoride TiF2 and the crystallographic structure of cuprite Cu2O. Furthermore, we compute degree-based topological indices, mainly ABC, GA, ABC4, GA5 and general Randić indices. Furthermore, we also give exact results of these indices for the crystal structure of titanium difluoride TiF2 and the crystallographic structure of cuprite Cu2O.