A generalisation of the copair constructions for triangle-saturated graphs

Authors

  • MacDougall J.A.

Abstract

All triangle-saturated graphs can be generated from those that are primitive and minimally triangle-saturated. We show how to construct several new infinite families of primitive minimally triangle-saturated graphs, The method is a generalisation of the copair constructions, which have been described previously. For any order n, the number of graphs produced is an exponential function of n.

Published

2004-06-09

How to Cite

MacDougall J.A. (2004). A generalisation of the copair constructions for triangle-saturated graphs. Utilitas Mathematica, 66. Retrieved from http://utilitasmathematica.com/index.php/Index/article/view/316

Issue

Vol. 66 (2004): Volume 66, 2004

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.