Mortality of iterated Gallai graphs (Q1321643)

From MaRDI portal
Revision as of 14:20, 22 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Mortality of iterated Gallai graphs
scientific article

    Statements

    Mortality of iterated Gallai graphs (English)
    0 references
    0 references
    10 October 1994
    0 references
    The Gallai graph \(\Gamma(G)\) of a graph \(G\) is defined as the graph whose vertex-set is the edge-set of \(G\) where two vertices of \(\Gamma(G)\) are adjacent iff the edges in \(G\) are incident but do not span a triangle in \(G\), see i.e. \textit{T. Gallai} [Acta Math. Acad. Sci. Hung. 18, 25-66 (1967; Zbl 0153.260)]. The author characterizes Gallai-mortal graphs, which are graphs for which there exists an integer \(t\geq 0\), such that \(\Gamma^ t(G)\) is empty, with \(\Gamma^ t(G)=\Gamma(\Gamma^{t- 1}(G))\).
    0 references
    Gallai graph
    0 references
    0 references

    Identifiers