\vspace{0.2cm} Suppose $G$ is a simple and connected graph. The first and second Zagreb indices of $G$ are two degree-based graph invariants defined as $M_1(G) = \sum_{v \in V(G)}deg(v)^2$ and $M_2(G) = \sum_{e=uv \in E(G)}deg(u)deg(v)$, respectively. The graph $G$ is called $p-$quasi $k-$cyclic, if there exists a subset $S$ of vertices such that $|S| = p$, $G \setminus S$ is $k-$cyclic and there is no a subset $S^\prime$ of $V(G)$ such that $|S^\prime| < |S|$ and $G \setminus S^\prime$ is $k-$cyclic. The aim of this paper is to characterize all graphs with maximum values of Zagreb indices among all $p-$quasi $k-$cyclic graphs with $k \leq 3$. & & \vspace{0.2cm}
Ashrafi,A R and Ghalavand,A . (2019). Maximum Zagreb Indices Among All $p-$Quasi $k-$Cyclic Graphs. Journal of Algorithms and Computation, 51(2), 75-82. doi: 10.22059/jac.2019.75164
MLA
Ashrafi,A R , and Ghalavand,A . "Maximum Zagreb Indices Among All $p-$Quasi $k-$Cyclic Graphs", Journal of Algorithms and Computation, 51, 2, 2019, 75-82. doi: 10.22059/jac.2019.75164
HARVARD
Ashrafi A R, Ghalavand A. (2019). 'Maximum Zagreb Indices Among All $p-$Quasi $k-$Cyclic Graphs', Journal of Algorithms and Computation, 51(2), pp. 75-82. doi: 10.22059/jac.2019.75164
CHICAGO
A R Ashrafi and A Ghalavand, "Maximum Zagreb Indices Among All $p-$Quasi $k-$Cyclic Graphs," Journal of Algorithms and Computation, 51 2 (2019): 75-82, doi: 10.22059/jac.2019.75164
VANCOUVER
Ashrafi A R, Ghalavand A. Maximum Zagreb Indices Among All $p-$Quasi $k-$Cyclic Graphs. J. Algo. Comp.. 2019;51(2):75-82. doi: 10.22059/jac.2019.75164
