A novel graph invariant: The third leap Zagreb index under several graph operations

2019 ◽  
Vol 11 (05) ◽  
pp. 1950054 ◽  
Author(s):  
Durbar Maji ◽  
Ganesh Ghorai
Keyword(s):  
Tensor Product ◽  
Cartesian Product ◽  
Lexicographic Product ◽  
Graph Invariant ◽  
Zagreb Index ◽  
Zagreb Indices ◽  
The Third ◽  
Graph Operations ◽  
Strong Product ◽  
Corona Product

The third leap Zagreb index of a graph [Formula: see text] is denoted as [Formula: see text] and is defined as [Formula: see text], where [Formula: see text] and [Formula: see text] are the 2-distance degree and the degree of the vertex [Formula: see text] in [Formula: see text], respectively. The first, second and third leap Zagreb indices were introduced by Naji et al. [A. M. Naji, N. D. Soner and I. Gutman, On leap Zagreb indices of graphs, Commun. Combin. Optim. 2(2) (2017) 99–117] in 2017. In this paper, the behavior of the third leap Zagreb index under several graph operations like the Cartesian product, Corona product, neighborhood Corona product, lexicographic product, strong product, tensor product, symmetric difference and disjunction of two graphs is studied.

scholarly journals The Sigma Coindex of Graph Operations

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Yasar Nacaroglu
Keyword(s):  
Tensor Product ◽  
Cartesian Product ◽  
Lexicographic Product ◽  
Nonadjacent Vertex ◽  
Graph Operations ◽  
Strong Product ◽  
Mathematical Properties ◽  
Corona Product

The sigma coindex is defined as the sum of the squares of the differences between the degrees of all nonadjacent vertex pairs. In this paper, we propose some mathematical properties of the sigma coindex. Later, we present precise results for the sigma coindices of various graph operations such as tensor product, Cartesian product, lexicographic product, disjunction, strong product, union, join, and corona product.

scholarly journals Sharp Bounds for the Inverse Sum Indeg Index of Graph Operations

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Anam Rani ◽  
Muhammad Imran ◽  
Usman Ali
Keyword(s):  
Tensor Product ◽  
Physicochemical Properties ◽  
Cartesian Product ◽  
Total Surface Area ◽  
Sharp Bounds ◽  
Graph Operations ◽  
Strong Product ◽  
Octane Isomers ◽  
International Academy ◽  
Corona Product

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.

scholarly journals The First and Second Zagreb Index of Complement Graph and Its Applications of Molecular Graph

2020 ◽  
pp. 15-30
Author(s):  
Mohammed S. Alsharafi ◽  
Mahioub M. Shubatah ◽  
Abdu Q. Alameri
Keyword(s):  
Tensor Product ◽  
Molecular Graph ◽  
Cartesian Product ◽  
Mathematical Operation ◽  
Zagreb Index ◽  
Zagreb Indices ◽  
Second Zagreb Index ◽  
Strong Product ◽  
Complement Graph ◽  
Graph Operation

In this paper, some basic mathematical operation for the second Zagreb indices of graph containing the join and strong product of graph operation, and the rst and second Zagreb indices of complement graph operations such as cartesian product G1 G2, composition G1 G2, disjunction G1 _ G2, symmetric dierence G1 G2, join G1 + G2, tensor product G1  G2, and strong product G1 G2 will be explained. The results are applied to molecular graph of nanotorus and titania nanotubes.

scholarly journals Upper Bounds for the Modified Second Multiplicative Zagreb Index of Graph Operations

2016 ◽  
Vol 17 ◽  
pp. 10-16
Author(s):  
Bommanahal Basavanagoud ◽  
Shreekant Patil
Keyword(s):  
Connected Graph ◽  
Cartesian Product ◽  
Upper Bounds ◽  
Zagreb Index ◽  
Graph Operations ◽  
Product Composition ◽  
Degree Of A Vertex ◽  
Product Of Graphs ◽  
Corona Product

The modified second multiplicative Zagreb index of a connected graph G, denoted by $\prod_{2}^{*}(G)$, is defined as $\prod_{2}^{*}(G)=\prod \limits_{uv\in E(G)}[d_{G}(u)+d_{G}(v)]^{[d_{G}(u)+d_{G}(v)]}$ where $d_{G}(z)$ is the degree of a vertex z in G. In this paper, we present some upper bounds for the modified second multiplicative Zagreb index of graph operations such as union, join, Cartesian product, composition and corona product of graphs are derived.The modified second multiplicative Zagreb index of aconnected graph , denoted by , is defined as where is the degree of avertex in . In this paper, we present some upper bounds for themodified second multiplicative Zagreb index of graph operations such as union,join, Cartesian product, composition and corona product of graphs are derived.

General reduced second Zagreb index of graph operations

2020 ◽  
pp. 2150082
Author(s):  
R. Khoeilar ◽  
A. Jahanbani
Keyword(s):  
Real Number ◽  
Cartesian Product ◽  
Zagreb Index ◽  
Second Zagreb Index ◽  
Graph Operations ◽  
Vertex Set ◽  
Join Of Graphs ◽  
Corona Product

Let [Formula: see text] be a graph with vertex set [Formula: see text] and edge set [Formula: see text]. The general reduced second Zagreb index of [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is any real number and [Formula: see text] is the degree of the vertex [Formula: see text] of [Formula: see text]. In this paper, the general reduced second Zagreb index of the Cartesian product, corona product, join of graphs and two new operations of graphs are computed.

scholarly journals The Reciprocal Complementary Wiener Number of Graph Operations

2021 ◽  
Vol 45 (01) ◽  
pp. 139-154
Author(s):  
R. NASIRI ◽  
A. NAKHAEI ◽  
A. R. SHOJAEIFARD
Keyword(s):  
Connected Graph ◽  
Cartesian Product ◽  
Symmetric Difference ◽  
Graph Operations ◽  
Strong Product ◽  
Product Composition ◽  
Wiener Number ◽  
Corona Product

The reciprocal complementary Wiener number of a connected graph G is defined as ∑ {x,y}⊆V (G) 1 D+1-−-dG(x,y), where D is the diameter of G and dG(x,y) is the distance between vertices x and y. In this work, we study the reciprocal complementary Wiener number of various graph operations such as join, Cartesian product, composition, strong product, disjunction, symmetric difference, corona product, splice and link of graphs.

scholarly journals On the Reformulated Second Zagreb Index of Graph Operations

2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Durbar Maji ◽  
Ganesh Ghorai ◽  
Yaé Ulrich Gaba
Keyword(s):  
Biological Activities ◽  
Cartesian Product ◽  
Real Numbers ◽  
Zagreb Index ◽  
Second Zagreb Index ◽  
Graph Operations ◽  
Sum Of Products ◽  
Physical Attributes ◽  
Vertex Degrees ◽  
Corona Product

Topological indices (TIs) are expressed by constant real numbers that reveal the structure of the graphs in QSAR/QSPR investigation. The reformulated second Zagreb index (RSZI) is such a novel TI having good correlations with various physical attributes, chemical reactivities, or biological activities/properties. The RSZI is defined as the sum of products of edge degrees of the adjacent edges, where the edge degree of an edge is taken to be the sum of vertex degrees of two end vertices of that edge with minus 2. In this study, the behaviour of RSZI under graph operations containing Cartesian product, join, composition, and corona product of two graphs has been established. We have also applied these results to compute RSZI for some important classes of molecular graphs and nanostructures.

scholarly journals Harmonic Index and Harmonic Polynomial on Graph Operations

Symmetry ◽  
2018 ◽  
Vol 10 (10) ◽  
pp. 456 ◽  
Author(s):  
Juan Hernández-Gómez ◽  
J. Méndez-Bermúdez ◽  
José Rodríguez ◽  
José M.  Sigarreta
Keyword(s):  
Lower Bounds ◽  
Convex Functions ◽  
Topological Index ◽  
Cartesian Product ◽  
Harmonic Polynomial ◽  
Upper And Lower Bounds ◽  
Lexicographic Product ◽  
Harmonic Index ◽  
Graph Operations ◽  
Corona Product

Some years ago, the harmonic polynomial was introduced to study the harmonic topological index. Here, using this polynomial, we obtain several properties of the harmonic index of many classical symmetric operations of graphs: Cartesian product, corona product, join, Cartesian sum and lexicographic product. Some upper and lower bounds for the harmonic indices of these operations of graphs, in terms of related indices, are derived from known bounds on the integral of a product on nonnegative convex functions. Besides, we provide an algorithm that computes the harmonic polynomial with complexity O ( n 2 ) .

scholarly journals Total Proper Connection and Graph Operations

2021 ◽  
pp. 2142006
Author(s):  
Yingying Zhang ◽  
Xiaoyu Zhu
Keyword(s):  
Connected Graph ◽  
Cartesian Product ◽  
Internal Vertex ◽  
Lexicographic Product ◽  
Colored Graph ◽  
Permutation Graphs ◽  
Connection Number ◽  
Graph Operations ◽  
Strong Product ◽  
Proper Connection Number

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].

scholarly journals Signless Laplacian Energy in Products of Intuitionistic Fuzzy Graphs

2019 ◽  
Vol 8 (3) ◽  
pp. 8536-8545
Keyword(s):  
Tensor Product ◽  
Cartesian Product ◽  
Fuzzy Graph ◽  
Lexicographic Product ◽  
Intuitionistic Fuzzy ◽  
Strong Product ◽  
Fuzzy Graphs ◽  
Laplacian Energy ◽  
Signless Laplacian ◽  
Intuitionistic Fuzzy Graphs

The observation of an Intuitionistic Fuzzy Graph’s signless laplacian energy is expanded innumerous products in Intuitionistic Fuzzy Graph. During this paper, we have got the value of signless laplacian Energy in unrelated products such as Cartesian product, Lexicographic Product, Tensor product and Strong Product, product, product and product amongst 2 intuitionistic Fuzzy graphs. Additionally we tend to study the relation between the Signless laplacian Energy within the varied products in 2 Intuitionistic Fuzzy Graphs

Sign in / Sign up

Export Citation Format

Share Document