DocServer

A Generalisation of the Copair Constructions for Triangle-saturated Graphs

MacDougall, James A. (2004) A Generalisation of the Copair Constructions for Triangle-saturated Graphs. Utilitas Mathematica, 66 . pp. 239-247.

[img]
Preview
PDF - Accepted Version
Download (134Kb) | Preview

    Abstract

    All triangle-saturated graphs can be generated from those that are primitive and minimally triangle-saturated. We show how to construct several new in¯nite 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$.

    Item Type: Article
    Subjects: 00-xx General
    Faculty: UNSPECIFIED
    Depositing User: Stephanie
    Date Deposited: 18 Nov 2010 12:07
    Last Modified: 18 Nov 2010 12:07
    URI: https://docserver.carma.newcastle.edu.au/id/eprint/807

    Actions (login required)

    View Item