Maximum Zagreb Indices Among All p-Quasi k-Cyclic Graphs
A Ghalavand, A R Ashrafi
TL;DR
This paper characterizes the graphs with the maximum Zagreb indices among all p-quasi k-cyclic graphs of order at least 3, focusing on their structural properties.
Contribution
It provides a characterization of the extremal p-quasi k-cyclic graphs that maximize Zagreb indices, a novel contribution in graph theory.
Findings
Identifies the structure of graphs with maximum Zagreb indices among p-quasi k-cyclic graphs.
Establishes bounds for Zagreb indices in this class of graphs.
Provides a method to determine extremal graphs for given parameters.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Computational Drug Discovery Methods · Synthesis and Properties of Aromatic Compounds