On zagreb indices of double vertex graphs
Citation
Kumar, S. S., Sundareswaran, R. & Sundarakannan, M. (2020). On zagreb indices of double vertex graphs. TWMS Journal of Applied and Engineering Mathematics, 10(4), 1096-1104.Abstract
Let G = (V, E) be a graph with at least 2 vertices, then the double vertex graph U₂(G) is the graph whose vertex set consists of all 2-subsets of V such that two distinct vertices {x, y} and {u, v} are adjacent if and only if |{x, y} ∩ {u, v}| = 1 and if x = u, then y and v are adjacent in G. Similarly, the complete double vertex graph, denoted by CU₂(G), has vertex set consists of all unordered pairs of elements of V and two distinct vertices {x, y} and {u, v} are adjacent if and only if |{x, y} ∩ {u, v}| = 1 and if x = u, then y and v are adjacent in G. In this work, we compute the zagreb indices of double vertex and complete double vertex graphs.
Source
TWMS Journal of Applied and Engineering MathematicsVolume
10Issue
4URI
https://hdl.handle.net/11729/2906http://jaem.isikun.edu.tr/web/index.php/archive/108-vol10no4/618
Collections
The following license files are associated with this item: