Elsevier

Discrete Applied Mathematics

Volume 270, 1 November 2019, Pages 153-158
Discrete Applied Mathematics

Extremal k-generalized quasi unicyclic graphs with respect to first and second Zagreb indices

https://doi.org/10.1016/j.dam.2019.06.006Get rights and content
Under an Elsevier user license
open archive

Abstract

The first and second Zagreb indices of a graph G are defined as: M1(G)=vV(G)d(v)2 and M2(G)=uvE(G)d(u)d(v), where d(v) is the degree of the vertex v. A graph G is said to be a quasi unicyclic graph, if there exists a vertex zV(G), such that Gz is a unicyclic graph and z is called a quasi vertex. For any integer k1 a graph G is called a k-generalized quasi unicyclic graph, if there exists a subset VkV(G) with cardinality k such that GVk is a unicyclic graph but for every subset Vk1 of cardinality k1 of V(G), the graph GVk1 is not unicyclic graph. In this paper, we investigate the upper and lower bounds on first and second Zagreb indices for k-generalized quasi unicyclic graphs. Moreover, we characterize the extremal graphs with maximum and minimum Zagreb indices.

Keywords

Extremal graphs
Quasi unicyclic graphs
k-generalized quasi unicyclic graphs
Zagreb indices

Cited by (0)