Maximum Zagreb Indices Among All p-Quasi k-Cyclic Graphs
Combinatorics
2019-10-08 v1
Abstract
A simple connected graph G is called a p-quasi k-cyclic graph, if there exists a subset S of vertices such that |S|=p, G-S is k-cyclic and there is no a subset S` of V(G) such that |S`|<|S| and G-S` is k-cyclic. The aim of this paper is to characterize graph with maximum values of Zagreb indices among all p-quasi k-cyclic graph of order k>=3.
Cite
@article{arxiv.1910.02415,
title = {Maximum Zagreb Indices Among All p-Quasi k-Cyclic Graphs},
author = {A Ghalavand and A R Ashrafi},
journal= {arXiv preprint arXiv:1910.02415},
year = {2019}
}
Comments
7 pages