DocServer

Two families of primitive minimally triangle-saturated graphs

MacDougall, James A. and Eggleton, Roger B. (1996) Two families of primitive minimally triangle-saturated graphs. Congressus Numerantium, 19 . pp. 85-96.

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

    Abstract

    The authors have previously shown [1] that to generate all triangle-saturated graphs (graphs of diameter at most 2), it su±ces to begin with the primitive minimally triangle-saturated graphs. In the present paper two infinite families of primitive minimally triangle-saturated graphs are constructed: one family covers all odd orders $n \geq 3$, the other all even orders $n \geq 4$, and in each case all graphs of order $n$ produced have the same size. For each order $n \geq 3$, the number of primitive minimally triangle-saturated graphs of order $n$ yielded by the relevant construction is exponentially quadratic in $n$.

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

    Actions (login required)

    View Item