Maximal cycles in graphs of large girth

研究成果: Article査読

抄録

In this paper we give a lower bound of the circumference of a graph in terms of girth and the number of edges. It is shown that a graph of girth at least g ≥ 4 with n vertices and at least m ≥ n edges contains a cycle of length at least (g - 2)m/(n - 2). In particular, for the case g = 4, an analogous result for 2-edge-connected weighted graphs is given. Moreover, the extremal case is characterized in both results.

本文言語English
ページ(範囲)427-438
ページ数12
ジャーナルSUT Journal of Mathematics
50
2
出版ステータスPublished - 2014

ASJC Scopus subject areas

  • Mathematics(all)

フィンガープリント 「Maximal cycles in graphs of large girth」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル