Irredundance-edge-removal-critical graphs

Authors

  • Cockayne E.J.
  • Favaron O.
  • Mynhardt C.M.

Abstract

We characterise the graphs G with ir (G) = 3 and ir (G - e) > 3 for every edge e of G.

Published

2001-05-09

How to Cite

Cockayne E.J., Favaron O., & Mynhardt C.M. (2001). Irredundance-edge-removal-critical graphs. Utilitas Mathematica, 59. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/234

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.