scholarly journals On the edge irregular reflexive labeling of corona product of graphs with path

Author(s):  
Kooi-Kuan Yoong ◽  
Roslan Hasni ◽  
Muhammad Irfan ◽  
Ibrahim Taraweh ◽  
Ali Ahmad ◽  
...  
Author(s):  
Dr. S. Nagarajan ◽  
◽  
G. Kayalvizhi ◽  
G. Priyadharsini ◽  
◽  
...  

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.


2016 ◽  
Vol 47 (2) ◽  
pp. 163-178
Author(s):  
Mahdieh Azari ◽  
Ali Iranmanesh

The vertex-edge Wiener index of a simple connected graph $G$ is defined as the sum of distances between vertices and edges of $G$. The vertex-edge Wiener polynomial of $G$ is a generating function whose first derivative is a $q-$analog of the vertex-edge Wiener index. Two possible distances $D_1(u, e|G)$ and $D_2(u, e|G)$ between a vertex $u$ and an edge $e$ of $G$ can be considered and corresponding to them, the first and second vertex-edge Wiener indices of $G$, and the first and second vertex-edge Wiener polynomials of $G$ are introduced. In this paper, we study the behavior of these indices and polynomials under the join and corona product of graphs. Results are applied for some classes of graphs such as suspensions, bottlenecks, and thorny graphs.


2020 ◽  
Vol 12 (06) ◽  
pp. 2050083
Author(s):  
I. Tarawneh ◽  
R. Hasni ◽  
A. Ahmad ◽  
G. C. Lau ◽  
S. M. Lee

Let [Formula: see text] be a simple graph with vertex set [Formula: see text] and edge set [Formula: see text], respectively. An edge irregular [Formula: see text]-labeling of [Formula: see text] is a labeling of [Formula: see text] with labels from the set [Formula: see text] in such a way that for any two different edges [Formula: see text] and [Formula: see text], their weights [Formula: see text] and [Formula: see text] are distinct. The weight of an edge [Formula: see text] in [Formula: see text] is the sum of the labels of the end vertices [Formula: see text] and [Formula: see text]. The minimum [Formula: see text] for which the graph [Formula: see text] has an edge irregular [Formula: see text]-labeling is called the edge irregularity strength of [Formula: see text], denoted by [Formula: see text]. In this paper, we determine the exact value of edge irregularity strength of corona product of graphs with cycle.


2018 ◽  
Vol 1008 ◽  
pp. 012040 ◽  
Author(s):  
Ridho Alfarisi ◽  
Dafik ◽  
Slamin ◽  
I. H. Agustin ◽  
A. I. Kristiana

Author(s):  
Bommanahal Basavanagoud ◽  
Shreekant Patil

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.


2018 ◽  
Author(s):  
D. A. R. Wardani ◽  
Dafik ◽  
I. H. Agustin ◽  
Marsidi ◽  
C. D. Putri

2020 ◽  
Vol 9 (10) ◽  
pp. 8367-8374
Author(s):  
M. Jayalakshmi ◽  
M. M. Padma

Sign in / Sign up

Export Citation Format

Share Document