2000 character limit reached
Maximum Zagreb Indices Among All p-Quasi k-Cyclic Graphs (1910.02415v1)
Published 6 Oct 2019 in math.CO
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 Sof 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.