Maximal independent sets in graphs with cyclomatic number at most two

Authors

  • Li, Shuchao
  • Jing, Wei

Abstract

In this paper, we determine the largest number of maximal independent sets among all connected graphs on n vertices with cyclomatic number c, for c ≤ 2. We also characterize those extremal graphs achieving the maximum values.

Published

2010-09-09

How to Cite

Li, Shuchao, & Jing, Wei. (2010). Maximal independent sets in graphs with cyclomatic number at most two. Utilitas Mathematica, 83. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/662

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.