On the entire Zagreb indices of the line graph and line cut-vertex graph of the subdivision graph

Nagesh, H. M. and V. R, Girish (2020) On the entire Zagreb indices of the line graph and line cut-vertex graph of the subdivision graph. Open Journal of Mathematical Sciences, 4 (1). pp. 470-475. ISSN 26164906

[thumbnail of on-the-entire-zagreb-indices-of-the-line-graph-and-line-cut-vertex-graph-of-the-subdivision-graph.pdf] Text
on-the-entire-zagreb-indices-of-the-line-graph-and-line-cut-vertex-graph-of-the-subdivision-graph.pdf - Published Version

Download (404kB)

Abstract

Let G = ( V , E ) be a graph. Then the first and second entire Zagreb indices of G are defined, respectively, as M ε 1 ( G ) = ∑ x ∈ V ( G ) ∪ E ( G ) ( d G ( x ) ) 2 and M ε 2 ( G ) = ∑ { x , y } ∈ B ( G ) d G ( x ) d G ( y ) , where B ( G ) denotes the set of all 2-element subsets { x , y } such that { x , y } ⊆ V ( G ) ∪ E ( G ) and members of { x , y } are adjacent or incident to each other. In this paper, we obtain the entire Zagreb indices of the line graph and line cut-vertex graph of the subdivision graph of the friendship graph

Item Type: Article
Subjects: East India library > Mathematical Science
Depositing User: Unnamed user with email support@eastindialibrary.com
Date Deposited: 05 Jun 2023 05:44
Last Modified: 19 Oct 2024 03:59
URI: http://info.paperdigitallibrary.com/id/eprint/1277

Actions (login required)

View Item
View Item