scholarly journals HF-Index and Y-Index of Some New Graph of Operations

2022 ◽  
pp. 28-33
Author(s):  
Dr. S. Nagarajan ◽  
◽  
G. Kayalvizhi ◽  
G. Priyadharsini ◽  
◽  
...  
Keyword(s):  
Cartesian Product ◽  
Graph Operations ◽  
Join Of Graphs ◽  
Product Of Graphs ◽  
Corona Product

In this paper we derive HF index of some graph operations containing join, Cartesian Product, Corona Product of graphs and compute the Y index of new operations of graphs related to the join of graphs.

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.

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.

Star coloring under some graph operations

2021 ◽  
pp. 2250079
Author(s):  
B. Akhavan Mahdavi ◽  
M. Tavakoli ◽  
F. Rahbarnia ◽  
Alireza Ashrafi
Keyword(s):  
Chromatic Number ◽  
Lexicographic Product ◽  
Proper Coloring ◽  
Sharp Bounds ◽  
Graph Operations ◽  
Join Of Graphs ◽  
Star Coloring ◽  
Product Of Graphs

A star coloring of a graph [Formula: see text] is a proper coloring of [Formula: see text] such that no path of length 3 in [Formula: see text] is bicolored. In this paper, the star chromatic number of join of graphs is computed. Some sharp bounds for the star chromatic number of corona, lexicographic, deleted lexicographic and hierarchical product of graphs together with a conjecture on the star chromatic number of lexicographic product of graphs are also presented.

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.

Restrained geodetic domination in graphs

2020 ◽  
Vol 12 (06) ◽  
pp. 2050084
Author(s):  
John Joy Mulloor ◽  
V. Sangeetha
Keyword(s):  
Connected Graph ◽  
Dominating Set ◽  
Cartesian Product ◽  
Minimum Cardinality ◽  
Geodetic Set ◽  
Vertex Set ◽  
Isolated Vertex ◽  
Join Of Graphs ◽  
Domination In Graphs ◽  
Corona Product

Let [Formula: see text] be a graph with edge set [Formula: see text] and vertex set [Formula: see text]. For a connected graph [Formula: see text], a vertex set [Formula: see text] of [Formula: see text] is said to be a geodetic set if every vertex in [Formula: see text] lies in a shortest path between any pair of vertices in [Formula: see text]. If the geodetic set [Formula: see text] is dominating, then [Formula: see text] is geodetic dominating set. A vertex set [Formula: see text] of [Formula: see text] is said to be a restrained geodetic dominating set if [Formula: see text] is geodetic, dominating and the subgraph induced by [Formula: see text] has no isolated vertex. The minimum cardinality of such set is called restrained geodetic domination (rgd) number. In this paper, rgd number of certain classes of graphs and 2-self-centered graphs was discussed. The restrained geodetic domination is discussed in graph operations such as Cartesian product and join of graphs. Restrained geodetic domination in corona product between a general connected graph and some classes of graphs is also discussed in this paper.

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 Perfect state transfer, integral circulants, and join of graphs

2010 ◽  
Vol 10 (3&4) ◽  
pp. 325-342
Author(s):  
R.-J. Angeles-Canul ◽  
R.M. Norton ◽  
M.C. Opperman ◽  
C.C. Paribello ◽  
M.C. Russell ◽  
...  
Keyword(s):  
Applied Mathematics ◽  
Cartesian Product ◽  
Specific Class ◽  
Perfect State ◽  
Regular Graphs ◽  
State Transfer ◽  
Join Of Graphs ◽  
Perfect State Transfer ◽  
Transfer Integral ◽  
Product Of Graphs

We propose new families of graphs which exhibit quantum perfect state transfer. Our constructions are based on the join operator on graphs, its circulant generalizations, and the Cartesian product of graphs. We build upon the results of Ba\v{s}i\'{c} and Petkovi\'{c} ({\em Applied Mathematics Letters} {\bf 22}(10):1609-1615, 2009) and construct new integral circulants and regular graphs with perfect state transfer. More specifically, we show that the integral circulant $\textsc{ICG}_{n}(\{2,n/2^{b}\} \cup Q)$ has perfect state transfer, where $b \in \{1,2\}$, $n$ is a multiple of $16$ and $Q$ is a subset of the odd divisors of $n$. Using the standard join of graphs, we also show a family of double-cone graphs which are non-periodic but exhibit perfect state transfer. This class of graphs is constructed by simply taking the join of the empty two-vertex graph with a specific class of regular graphs. This answers a question posed by Godsil (arxiv.org math/08062074).

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.

Sign in / Sign up

Export Citation Format

Share Document