The Second Hyper-Zagreb Index of Complement Graphs and Its Applications of Some Nano Structures

In chemical graph theory, a topological descriptor is a numerical quantity that is based on the chemical structure of underlying chemical compound. Topological indices play an important role in chemical graph theory especially in the quantitative structure-property relationship (QSPR) and quantitative structure-activity relationship (QSAR). In this paper, we present explicit formulae for some basic mathematical operations for the second hyper-Zagreb index of complement graph containing the join G1 + G2, tensor product G1 \(\otimes\) G2, Cartesian product G1 x G2, composition G1 \(\circ\) G2, strong product G1 * G2, disjunction G1 V G2 and symmetric difference G1 \(\oplus\) G2. Moreover, we studied the second hyper-Zagreb index for some certain important physicochemical structures such as molecular complement graphs of V-Phenylenic Nanotube V PHX[q, p], V-Phenylenic Nanotorus V PHY [m, n] and Titania Nanotubes TiO2.

On the Exact Values of HZ-Index for the Graphs under Operations

Topological index (TI) is a function from the set of graphs to the set of real numbers that associates a unique real number to each graph, and two graphs necessarily have the same value of the TI if these are structurally isomorphic. In this note, we compute the HZ − index of the four generalized sum graphs in the form of the various Zagreb indices of their factor graphs. These graphs are obtained by the strong product of the graphs G and D k G , where D k ∈ S k , R k , Q k , T k represents the four generalized subdivision-related operations for the integral value of k ≥ 1 and D k G is a graph that is obtained by applying D k on G . At the end, as an illustration, we compute the HZ − index of the generalized sum graphs for exactly k = 1 and compare the obtained results.

The Second Hyper-Zagreb Coindex of Chemical Graphs and Some Applications

The second hyper-Zagreb coindex is an efficient topological index that enables us to describe a molecule from its molecular graph. In this current study, we shall evaluate the second hyper-Zagreb coindex of some chemical graphs. In this study, we compute the value of the second hyper-Zagreb coindex of some chemical graph structures such as sildenafil, aspirin, and nicotine. We also present explicit formulas of the second hyper-Zagreb coindex of any graph that results from some interesting graphical operations such as tensor product, Cartesian product, composition, and strong product, and apply them on a q-multiwalled nanotorus.

Estimates for the Norm of Generalized Maximal Operator on Strong Product of Graphs

Let G = G 1 × G 2 × ⋯ × G m be the strong product of simple, finite connected graphs, and let ϕ : ℕ ⟶ 0 , ∞ be an increasing function. We consider the action of generalized maximal operator M G ϕ on ℓ p spaces. We determine the exact value of ℓ p -quasi-norm of M G ϕ for the case when G is strong product of complete graphs, where 0 < p ≤ 1 . However, lower and upper bounds of ℓ p -norm have been determined when 1 < p < ∞ . Finally, we computed the lower and upper bounds of M G ϕ p when G is strong product of arbitrary graphs, where 0 < p ≤ 1 .

Total Proper Connection and Graph Operations

A graph is said to be total-colored if all the edges and vertices of the graph are colored. A path in a total-colored graph is a total proper path if (i) any two adjacent edges on the path differ in color, (ii) any two internal adjacent vertices on the path differ in color, and (iii) any internal vertex of the path differs in color from its incident edges on the path. A total-colored graph is called total-proper connected if any two vertices of the graph are connected by a total proper path of the graph. For a connected graph [Formula: see text], the total proper connection number of [Formula: see text], denoted by [Formula: see text], is defined as the smallest number of colors required to make [Formula: see text] total-proper connected. In this paper, we study the total proper connection number for the graph operations. We find that 3 is the total proper connection number for the join, the lexicographic product and the strong product of nearly all graphs. Besides, we study three kinds of graphs with one factor to be traceable for the Cartesian product as well as the permutation graphs of the star and traceable graphs. The values of the total proper connection number for these graphs are all [Formula: see text].

LIGHTS OUT! on graph products over the ring of integers modulo k

LIGHTS OUT! is a game played on a finite, simple graph. The vertices of the graph are the lights, which may be on or off, and the edges of the graph determine how neighboring vertices turn on or off when a vertex is pressed. Given an initial configuration of vertices that are on, the object of the game is to turn all the lights out. The traditional game is played over $\mathbb{Z}_2$, where the vertices are either lit or unlit, but the game can be generalized to $\mathbb{Z}_k$, where the lights have different colors. Previously, the game was investigated on Cartesian product graphs over $\mathbb{Z}_2$. We extend this work to $\mathbb{Z}_k$ and investigate two other fundamental graph products, the direct (or tensor) product and the strong product. We provide conditions for which the direct product graph and the strong product graph are solvable based on the factor graphs, and we do so using both open and closed neighborhood switching over $\mathbb{Z}_k$.

Sharp Bounds for the Inverse Sum Indeg Index of Graph Operations

Vukičević and Gasperov introduced the concept of 148 discrete Adriatic indices in 2010. These indices showed good predictive properties against the testing sets of the International Academy of Mathematical Chemistry. Among these indices, twenty indices were taken as beneficial predictors of physicochemical properties. The inverse sum indeg index denoted by ISI G k of G k is a notable predictor of total surface area for octane isomers and is presented as ISI G k = ∑ g k g k ′ ∈ E G k d G k g k d G k g k ′ / d G k g k + d G k g k ′ , where d G k g k represents the degree of g k ∈ V G k . In this paper, we determine sharp bounds for ISI index of graph operations, including the Cartesian product, tensor product, strong product, composition, disjunction, symmetric difference, corona product, Indu–Bala product, union of graphs, double graph, and strong double graph.