Graph Invariants of Deleted Lexicographic Product of Graphs
The deleted lexicographic product G[H]-nG of graphs G and H is a graph with vertex set V(G)×V(H) and u=(u1, v1) is adjacent with v=(u2, v2) whenever (u1=u2 and v1 is adjacent with v2) or (v1 ≠ v2 and u1 is adjacent with u2). In this paper, we compute the exact values of the Wiener, ve...
Main Authors: | Bahare Akhavan Mahdavi, Mostafa Tavakoli, Freydoon Rahbarnia |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Kashan
2019-12-01
|
Series: | Mathematics Interdisciplinary Research |
Subjects: | |
Online Access: | https://mir.kashanu.ac.ir/article_102486_8728c06bbd29a7f7c9f2daefaaa2fa55.pdf |
Similar Items
-
Some distance based indices of graphs based on four new operations related to the lexicographic product
by: N. Dehgardi, et al.
Published: (2019-12-01) -
Bounds for metric dimension and defensive $k$-alliance of graphs under deleted lexicographic product
by: Kinkar Chandra Das, et al.
Published: (2020-03-01) -
Reformulated First Zagreb Index of Some Graph Operations
by: Nilanjan De, et al.
Published: (2015-10-01) -
Graphs with fixed number of pendent vertices and minimal first Zagreb index
by: Ivan Gutman, et al.
Published: (2015-03-01) -
Relations between Wiener, hyper-Wiener and some Zagreb type indices
by: Ghalavand Ali, et al.
Published: (2019-01-01)