On the Maximum Zagreb Indices of Graphs with k Cut Vertices

ISSN： 0167-8019

Source： Acta Applicandae Mathematicae, Vol.111, Iss.1, 2010-07, pp. : 93-106

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Extremal Zagreb Indices of Graphs with a Given Number of Cut Edges

By Chen Shubo Liu Weijun

Graphs and Combinatorics, Vol. 30, Iss. 1, 2014-01 ,pp. : 109-118

Springer Publishing Company

Access to resources Recommend Favorite

The Maximum Size Of Graphs With A Uniquek- Factor

By Volkmann Lutz

Combinatorica, Vol. 24, Iss. 3, 2004-07 ,pp. : 531-540

Springer Publishing Company

Access to resources Recommend Favorite

Algorithms for the maximum k-club problem in graphs

By Shahinpour Shahram Butenko Sergiy

Journal of Combinatorial Optimization, Vol. 26, Iss. 3, 2013-10 ,pp. : 520-554

Springer Publishing Company

Access to resources Recommend Favorite

New result on chromaticity of K₄-homeomorphic graphs

By Catada-Ghimire S. Hasni R.

International Journal of Computer Mathematics, Vol. 91, Iss. 5, 2014-05 ,pp. : 834-843

Taylor & Francis Ltd

Access to resources Recommend Favorite

Paired versus double domination in K _1,r-free graphs

By Dorbec Paul Hartnell Bert Henning Michael

Journal of Combinatorial Optimization, Vol. 27, Iss. 4, 2014-05 ,pp. : 688-694

Springer Publishing Company

Access to resources Recommend Favorite