Maximum Zagreb Indices Among All p-Quasi k-Cyclic Graphs

Published 6 Oct 2019 in math.CO | (1910.02415v1)

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.

Abstract PDF Upgrade to Chat

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Create Your Own

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.